./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pj_icu.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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.pj_icu.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 81684cd6f6f9906a1fa983a1abdb27554546d8d43af37740ea6944465197b3b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:47:50,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:47:50,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 19:47:50,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:47:50,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:47:50,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:47:50,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:47:50,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:47:50,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:47:50,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:47:50,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:47:50,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:47:50,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:47:50,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:47:50,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:47:50,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:47:50,902 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 -> 81684cd6f6f9906a1fa983a1abdb27554546d8d43af37740ea6944465197b3b8 [2025-02-05 19:47:51,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:47:51,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:47:51,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:47:51,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:47:51,133 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:47:51,134 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.pj_icu.c [2025-02-05 19:47:52,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51f12d252/a64c2251212642c587f212d23618f59c/FLAGf6bd57ece [2025-02-05 19:47:52,680 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:47:52,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pj_icu.c [2025-02-05 19:47:52,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51f12d252/a64c2251212642c587f212d23618f59c/FLAGf6bd57ece [2025-02-05 19:47:52,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51f12d252/a64c2251212642c587f212d23618f59c [2025-02-05 19:47:52,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:47:52,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:47:52,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:47:52,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:47:52,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:47:52,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:47:52" (1/1) ... [2025-02-05 19:47:52,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c453938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:52, skipping insertion in model container [2025-02-05 19:47:52,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:47:52" (1/1) ... [2025-02-05 19:47:52,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:47:52,996 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.pj_icu.c[1246,1259] [2025-02-05 19:47:53,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:47:53,311 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:47:53,318 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.pj_icu.c[1246,1259] [2025-02-05 19:47:53,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:47:53,539 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:47:53,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53 WrapperNode [2025-02-05 19:47:53,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:47:53,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:47:53,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:47:53,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:47:53,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:53,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,096 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5178 [2025-02-05 19:47:54,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:47:54,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:47:54,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:47:54,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:47:54,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,381 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 19:47:54,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:47:54,579 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:47:54,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:47:54,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:47:54,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (1/1) ... [2025-02-05 19:47:54,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:47:54,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:47:54,611 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-02-05 19:47:54,616 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-02-05 19:47:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:47:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 19:47:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:47:54,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:47:55,032 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:47:55,034 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:47:58,433 INFO L? ?]: Removed 3377 outVars from TransFormulas that were not future-live. [2025-02-05 19:47:58,434 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:47:58,580 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:47:58,580 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 19:47:58,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:47:58 BoogieIcfgContainer [2025-02-05 19:47:58,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:47:58,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:47:58,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:47:58,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:47:58,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:47:52" (1/3) ... [2025-02-05 19:47:58,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad85d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:47:58, skipping insertion in model container [2025-02-05 19:47:58,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:47:53" (2/3) ... [2025-02-05 19:47:58,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad85d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:47:58, skipping insertion in model container [2025-02-05 19:47:58,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:47:58" (3/3) ... [2025-02-05 19:47:58,599 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.pj_icu.c [2025-02-05 19:47:58,611 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:47:58,612 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.pj_icu.c that has 1 procedures, 1214 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:47:58,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:47:58,730 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;@5d8104b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:47:58,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:47:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 1214 states, 1212 states have (on average 1.4991749174917492) internal successors, (1817), 1213 states have internal predecessors, (1817), 0 states have call successors, (0), 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-02-05 19:47:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 19:47:58,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:47:58,764 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] [2025-02-05 19:47:58,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:47:58,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:47:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash -56749263, now seen corresponding path program 1 times [2025-02-05 19:47:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:47:58,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366992228] [2025-02-05 19:47:58,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:47:58,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:47:58,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 19:47:59,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 19:47:59,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:47:59,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:00,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:00,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366992228] [2025-02-05 19:48:00,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366992228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:00,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:48:00,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100809970] [2025-02-05 19:48:00,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:00,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:48:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:00,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:48:00,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:48:00,030 INFO L87 Difference]: Start difference. First operand has 1214 states, 1212 states have (on average 1.4991749174917492) internal successors, (1817), 1213 states have internal predecessors, (1817), 0 states have call successors, (0), 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 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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-02-05 19:48:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:00,860 INFO L93 Difference]: Finished difference Result 2309 states and 3459 transitions. [2025-02-05 19:48:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:48:00,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-02-05 19:48:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:00,881 INFO L225 Difference]: With dead ends: 2309 [2025-02-05 19:48:00,882 INFO L226 Difference]: Without dead ends: 1213 [2025-02-05 19:48:00,887 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-02-05 19:48:00,889 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4525 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:00,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4525 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 19:48:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-02-05 19:48:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2025-02-05 19:48:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 1.4975247524752475) internal successors, (1815), 1212 states have internal predecessors, (1815), 0 states have call successors, (0), 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-02-05 19:48:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1815 transitions. [2025-02-05 19:48:00,948 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1815 transitions. Word has length 133 [2025-02-05 19:48:00,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:00,949 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1815 transitions. [2025-02-05 19:48:00,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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-02-05 19:48:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1815 transitions. [2025-02-05 19:48:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 19:48:00,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:00,950 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] [2025-02-05 19:48:00,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 19:48:00,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:00,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1754546349, now seen corresponding path program 1 times [2025-02-05 19:48:00,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:00,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296091653] [2025-02-05 19:48:00,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:01,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 19:48:01,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 19:48:01,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:01,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:01,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:01,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296091653] [2025-02-05 19:48:01,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296091653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:01,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:01,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:48:01,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976433245] [2025-02-05 19:48:01,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:01,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:48:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:01,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:48:01,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:48:01,361 INFO L87 Difference]: Start difference. First operand 1213 states and 1815 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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-02-05 19:48:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:01,850 INFO L93 Difference]: Finished difference Result 2310 states and 3457 transitions. [2025-02-05 19:48:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:48:01,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-02-05 19:48:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:01,855 INFO L225 Difference]: With dead ends: 2310 [2025-02-05 19:48:01,855 INFO L226 Difference]: Without dead ends: 1215 [2025-02-05 19:48:01,857 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-02-05 19:48:01,857 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 3012 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4522 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:01,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4522 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-02-05 19:48:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2025-02-05 19:48:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 1.4967051070840198) internal successors, (1817), 1214 states have internal predecessors, (1817), 0 states have call successors, (0), 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-02-05 19:48:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1817 transitions. [2025-02-05 19:48:01,879 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1817 transitions. Word has length 134 [2025-02-05 19:48:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:01,879 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1817 transitions. [2025-02-05 19:48:01,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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-02-05 19:48:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1817 transitions. [2025-02-05 19:48:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 19:48:01,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:01,881 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] [2025-02-05 19:48:01,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 19:48:01,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:01,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash -919818388, now seen corresponding path program 1 times [2025-02-05 19:48:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:01,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050357505] [2025-02-05 19:48:01,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:01,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 19:48:02,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 19:48:02,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:02,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:02,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:02,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050357505] [2025-02-05 19:48:02,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050357505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:02,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:02,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:02,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511114670] [2025-02-05 19:48:02,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:02,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:02,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:02,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:02,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:02,529 INFO L87 Difference]: Start difference. First operand 1215 states and 1817 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:03,094 INFO L93 Difference]: Finished difference Result 2316 states and 3464 transitions. [2025-02-05 19:48:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:03,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-02-05 19:48:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:03,099 INFO L225 Difference]: With dead ends: 2316 [2025-02-05 19:48:03,099 INFO L226 Difference]: Without dead ends: 1219 [2025-02-05 19:48:03,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:48:03,101 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 1692 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 4517 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:03,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1692 Valid, 4517 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-02-05 19:48:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1218. [2025-02-05 19:48:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1217 states have (on average 1.495480690221857) internal successors, (1820), 1217 states have internal predecessors, (1820), 0 states have call successors, (0), 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-02-05 19:48:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1820 transitions. [2025-02-05 19:48:03,118 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1820 transitions. Word has length 135 [2025-02-05 19:48:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:03,118 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1820 transitions. [2025-02-05 19:48:03,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1820 transitions. [2025-02-05 19:48:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 19:48:03,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:03,119 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] [2025-02-05 19:48:03,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 19:48:03,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:03,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1665365484, now seen corresponding path program 1 times [2025-02-05 19:48:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887971453] [2025-02-05 19:48:03,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:03,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:03,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 19:48:03,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 19:48:03,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:03,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:04,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:04,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887971453] [2025-02-05 19:48:04,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887971453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:04,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:04,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:04,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929620477] [2025-02-05 19:48:04,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:04,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:04,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:04,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:04,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:04,669 INFO L87 Difference]: Start difference. First operand 1218 states and 1820 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 19:48:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:05,286 INFO L93 Difference]: Finished difference Result 2443 states and 3651 transitions. [2025-02-05 19:48:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:05,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-02-05 19:48:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:05,290 INFO L225 Difference]: With dead ends: 2443 [2025-02-05 19:48:05,290 INFO L226 Difference]: Without dead ends: 1343 [2025-02-05 19:48:05,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:48:05,293 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2122 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:05,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 4441 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:48:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-02-05 19:48:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1224. [2025-02-05 19:48:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1223 states have (on average 1.4946852003270645) internal successors, (1828), 1223 states have internal predecessors, (1828), 0 states have call successors, (0), 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-02-05 19:48:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1828 transitions. [2025-02-05 19:48:05,315 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1828 transitions. Word has length 136 [2025-02-05 19:48:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:05,315 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1828 transitions. [2025-02-05 19:48:05,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 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-02-05 19:48:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1828 transitions. [2025-02-05 19:48:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 19:48:05,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:05,317 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] [2025-02-05 19:48:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 19:48:05,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:05,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2114666715, now seen corresponding path program 1 times [2025-02-05 19:48:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36572694] [2025-02-05 19:48:05,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:05,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 19:48:05,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 19:48:05,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:05,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:06,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:06,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36572694] [2025-02-05 19:48:06,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36572694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:06,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:06,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:48:06,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814728341] [2025-02-05 19:48:06,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:06,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:48:06,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:06,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:48:06,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:48:06,267 INFO L87 Difference]: Start difference. First operand 1224 states and 1828 transitions. Second operand has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 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-02-05 19:48:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:07,312 INFO L93 Difference]: Finished difference Result 2447 states and 3656 transitions. [2025-02-05 19:48:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:07,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-02-05 19:48:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:07,319 INFO L225 Difference]: With dead ends: 2447 [2025-02-05 19:48:07,319 INFO L226 Difference]: Without dead ends: 1347 [2025-02-05 19:48:07,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:48:07,321 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 2133 mSDsluCounter, 5903 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 7380 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:07,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 7380 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 19:48:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-02-05 19:48:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1227. [2025-02-05 19:48:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1226 states have (on average 1.4942903752039152) internal successors, (1832), 1226 states have internal predecessors, (1832), 0 states have call successors, (0), 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-02-05 19:48:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1832 transitions. [2025-02-05 19:48:07,339 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1832 transitions. Word has length 137 [2025-02-05 19:48:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:07,339 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1832 transitions. [2025-02-05 19:48:07,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 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-02-05 19:48:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1832 transitions. [2025-02-05 19:48:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 19:48:07,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:07,340 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] [2025-02-05 19:48:07,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 19:48:07,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:07,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2013204527, now seen corresponding path program 1 times [2025-02-05 19:48:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865266413] [2025-02-05 19:48:07,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:07,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 19:48:07,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 19:48:07,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:07,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:08,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865266413] [2025-02-05 19:48:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865266413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 19:48:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983545866] [2025-02-05 19:48:08,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:08,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:48:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:08,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:48:08,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:48:08,664 INFO L87 Difference]: Start difference. First operand 1227 states and 1832 transitions. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 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-02-05 19:48:09,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:09,677 INFO L93 Difference]: Finished difference Result 2451 states and 3661 transitions. [2025-02-05 19:48:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:48:09,677 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 19:48:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:09,681 INFO L225 Difference]: With dead ends: 2451 [2025-02-05 19:48:09,681 INFO L226 Difference]: Without dead ends: 1351 [2025-02-05 19:48:09,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-02-05 19:48:09,683 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 2141 mSDsluCounter, 6163 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2141 SdHoareTripleChecker+Valid, 7640 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:09,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2141 Valid, 7640 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:48:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-02-05 19:48:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1230. [2025-02-05 19:48:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1229 states have (on average 1.4938974776240845) internal successors, (1836), 1229 states have internal predecessors, (1836), 0 states have call successors, (0), 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-02-05 19:48:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1836 transitions. [2025-02-05 19:48:09,701 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1836 transitions. Word has length 138 [2025-02-05 19:48:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:09,701 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1836 transitions. [2025-02-05 19:48:09,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 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-02-05 19:48:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1836 transitions. [2025-02-05 19:48:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 19:48:09,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:09,702 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] [2025-02-05 19:48:09,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 19:48:09,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:09,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1528663923, now seen corresponding path program 1 times [2025-02-05 19:48:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:09,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986344456] [2025-02-05 19:48:09,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:09,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 19:48:09,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 19:48:09,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:09,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986344456] [2025-02-05 19:48:10,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986344456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:10,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:10,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:48:10,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248836928] [2025-02-05 19:48:10,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:10,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:48:10,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:10,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:48:10,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:48:10,401 INFO L87 Difference]: Start difference. First operand 1230 states and 1836 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-02-05 19:48:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:10,883 INFO L93 Difference]: Finished difference Result 2329 states and 3479 transitions. [2025-02-05 19:48:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:48:10,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 19:48:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:10,887 INFO L225 Difference]: With dead ends: 2329 [2025-02-05 19:48:10,887 INFO L226 Difference]: Without dead ends: 1229 [2025-02-05 19:48:10,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:48:10,890 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 0 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:10,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3013 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2025-02-05 19:48:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2025-02-05 19:48:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1228 states have (on average 1.492671009771987) internal successors, (1833), 1228 states have internal predecessors, (1833), 0 states have call successors, (0), 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-02-05 19:48:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1833 transitions. [2025-02-05 19:48:10,907 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1833 transitions. Word has length 138 [2025-02-05 19:48:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:10,908 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1833 transitions. [2025-02-05 19:48:10,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-02-05 19:48:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1833 transitions. [2025-02-05 19:48:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 19:48:10,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:10,910 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] [2025-02-05 19:48:10,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 19:48:10,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:10,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1440803670, now seen corresponding path program 1 times [2025-02-05 19:48:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:10,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380244377] [2025-02-05 19:48:10,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:10,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:10,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 19:48:11,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 19:48:11,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:11,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:11,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:11,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380244377] [2025-02-05 19:48:11,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380244377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:11,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:48:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472410421] [2025-02-05 19:48:11,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:11,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:48:11,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:11,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:48:11,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:48:11,629 INFO L87 Difference]: Start difference. First operand 1229 states and 1833 transitions. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 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-02-05 19:48:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:12,798 INFO L93 Difference]: Finished difference Result 2448 states and 3654 transitions. [2025-02-05 19:48:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:48:12,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-02-05 19:48:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:12,802 INFO L225 Difference]: With dead ends: 2448 [2025-02-05 19:48:12,803 INFO L226 Difference]: Without dead ends: 1349 [2025-02-05 19:48:12,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-05 19:48:12,805 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 2129 mSDsluCounter, 6160 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 7637 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:12,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 7637 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 19:48:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-02-05 19:48:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1232. [2025-02-05 19:48:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 1.4922826969943135) internal successors, (1837), 1231 states have internal predecessors, (1837), 0 states have call successors, (0), 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-02-05 19:48:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1837 transitions. [2025-02-05 19:48:12,822 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1837 transitions. Word has length 139 [2025-02-05 19:48:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:12,822 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1837 transitions. [2025-02-05 19:48:12,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 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-02-05 19:48:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1837 transitions. [2025-02-05 19:48:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 19:48:12,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:12,823 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] [2025-02-05 19:48:12,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 19:48:12,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:12,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1960982122, now seen corresponding path program 1 times [2025-02-05 19:48:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:12,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159552151] [2025-02-05 19:48:12,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:12,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 19:48:12,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 19:48:12,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:12,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:13,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-02-05 19:48:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:13,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159552151] [2025-02-05 19:48:13,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159552151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:13,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:13,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:13,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989074052] [2025-02-05 19:48:13,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:13,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:13,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:13,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:13,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:13,184 INFO L87 Difference]: Start difference. First operand 1232 states and 1837 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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-02-05 19:48:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:13,797 INFO L93 Difference]: Finished difference Result 2441 states and 3643 transitions. [2025-02-05 19:48:13,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:13,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-02-05 19:48:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:13,801 INFO L225 Difference]: With dead ends: 2441 [2025-02-05 19:48:13,801 INFO L226 Difference]: Without dead ends: 1342 [2025-02-05 19:48:13,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:13,806 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2106 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2106 SdHoareTripleChecker+Valid, 4434 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:13,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2106 Valid, 4434 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:48:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-02-05 19:48:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1232. [2025-02-05 19:48:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 1.4914703493095045) internal successors, (1836), 1231 states have internal predecessors, (1836), 0 states have call successors, (0), 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-02-05 19:48:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1836 transitions. [2025-02-05 19:48:13,822 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1836 transitions. Word has length 139 [2025-02-05 19:48:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:13,822 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1836 transitions. [2025-02-05 19:48:13,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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-02-05 19:48:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1836 transitions. [2025-02-05 19:48:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 19:48:13,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:13,824 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] [2025-02-05 19:48:13,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 19:48:13,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:13,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1814874138, now seen corresponding path program 1 times [2025-02-05 19:48:13,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:13,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211380452] [2025-02-05 19:48:13,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:13,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:13,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 19:48:13,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 19:48:13,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:13,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:14,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211380452] [2025-02-05 19:48:14,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211380452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:14,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:14,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:14,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195477569] [2025-02-05 19:48:14,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:14,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:14,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:14,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:14,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:14,351 INFO L87 Difference]: Start difference. First operand 1232 states and 1836 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:14,959 INFO L93 Difference]: Finished difference Result 2438 states and 3638 transitions. [2025-02-05 19:48:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:14,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-02-05 19:48:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:14,963 INFO L225 Difference]: With dead ends: 2438 [2025-02-05 19:48:14,963 INFO L226 Difference]: Without dead ends: 1339 [2025-02-05 19:48:14,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:14,964 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2097 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2097 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:14,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2097 Valid, 4440 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:48:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2025-02-05 19:48:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1232. [2025-02-05 19:48:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 1.4906580016246953) internal successors, (1835), 1231 states have internal predecessors, (1835), 0 states have call successors, (0), 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-02-05 19:48:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1835 transitions. [2025-02-05 19:48:14,977 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1835 transitions. Word has length 140 [2025-02-05 19:48:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:14,977 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1835 transitions. [2025-02-05 19:48:14,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1835 transitions. [2025-02-05 19:48:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 19:48:14,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:14,978 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] [2025-02-05 19:48:14,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 19:48:14,979 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:14,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:14,979 INFO L85 PathProgramCache]: Analyzing trace with hash 202639414, now seen corresponding path program 1 times [2025-02-05 19:48:14,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:14,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702089565] [2025-02-05 19:48:14,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:15,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 19:48:15,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 19:48:15,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:15,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702089565] [2025-02-05 19:48:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702089565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:15,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:48:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098009406] [2025-02-05 19:48:15,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:15,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:48:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:15,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:48:15,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:48:15,722 INFO L87 Difference]: Start difference. First operand 1232 states and 1835 transitions. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:16,781 INFO L93 Difference]: Finished difference Result 2442 states and 3643 transitions. [2025-02-05 19:48:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:48:16,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-02-05 19:48:16,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:16,785 INFO L225 Difference]: With dead ends: 2442 [2025-02-05 19:48:16,785 INFO L226 Difference]: Without dead ends: 1343 [2025-02-05 19:48:16,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-05 19:48:16,787 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 2103 mSDsluCounter, 8851 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 10328 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:16,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2103 Valid, 10328 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 19:48:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-02-05 19:48:16,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1235. [2025-02-05 19:48:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1234 states have (on average 1.4902755267423013) internal successors, (1839), 1234 states have internal predecessors, (1839), 0 states have call successors, (0), 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-02-05 19:48:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1839 transitions. [2025-02-05 19:48:16,803 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1839 transitions. Word has length 140 [2025-02-05 19:48:16,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:16,803 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1839 transitions. [2025-02-05 19:48:16,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1839 transitions. [2025-02-05 19:48:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 19:48:16,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:16,804 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] [2025-02-05 19:48:16,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 19:48:16,804 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:16,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash 111448239, now seen corresponding path program 1 times [2025-02-05 19:48:16,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:16,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531415514] [2025-02-05 19:48:16,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:16,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 19:48:16,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 19:48:16,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:16,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:17,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531415514] [2025-02-05 19:48:17,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531415514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:17,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:17,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 19:48:17,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228739927] [2025-02-05 19:48:17,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:17,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 19:48:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:17,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 19:48:17,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-05 19:48:17,854 INFO L87 Difference]: Start difference. First operand 1235 states and 1839 transitions. Second operand has 15 states, 15 states have (on average 9.4) internal successors, (141), 15 states have internal predecessors, (141), 0 states have call successors, (0), 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-02-05 19:48:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:19,367 INFO L93 Difference]: Finished difference Result 2447 states and 3650 transitions. [2025-02-05 19:48:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 19:48:19,368 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.4) internal successors, (141), 15 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-02-05 19:48:19,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:19,371 INFO L225 Difference]: With dead ends: 2447 [2025-02-05 19:48:19,371 INFO L226 Difference]: Without dead ends: 1348 [2025-02-05 19:48:19,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-02-05 19:48:19,372 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 2107 mSDsluCounter, 12218 mSDsCounter, 0 mSdLazyCounter, 3315 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2107 SdHoareTripleChecker+Valid, 13688 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:19,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2107 Valid, 13688 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3315 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 19:48:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2025-02-05 19:48:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1245. [2025-02-05 19:48:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1244 states have (on average 1.4895498392282958) internal successors, (1853), 1244 states have internal predecessors, (1853), 0 states have call successors, (0), 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-02-05 19:48:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1853 transitions. [2025-02-05 19:48:19,388 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1853 transitions. Word has length 141 [2025-02-05 19:48:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:19,389 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1853 transitions. [2025-02-05 19:48:19,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.4) internal successors, (141), 15 states have internal predecessors, (141), 0 states have call successors, (0), 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-02-05 19:48:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1853 transitions. [2025-02-05 19:48:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 19:48:19,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:19,390 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] [2025-02-05 19:48:19,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 19:48:19,390 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:19,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash 321867707, now seen corresponding path program 1 times [2025-02-05 19:48:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:19,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506397852] [2025-02-05 19:48:19,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:19,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 19:48:19,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 19:48:19,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:19,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506397852] [2025-02-05 19:48:19,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506397852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:19,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:19,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353386493] [2025-02-05 19:48:19,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:19,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:19,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:19,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:19,806 INFO L87 Difference]: Start difference. First operand 1245 states and 1853 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 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-02-05 19:48:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:20,397 INFO L93 Difference]: Finished difference Result 2453 states and 3657 transitions. [2025-02-05 19:48:20,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:20,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-02-05 19:48:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:20,400 INFO L225 Difference]: With dead ends: 2453 [2025-02-05 19:48:20,400 INFO L226 Difference]: Without dead ends: 1344 [2025-02-05 19:48:20,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:20,402 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2088 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2088 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:20,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2088 Valid, 4440 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2025-02-05 19:48:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1242. [2025-02-05 19:48:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 1.4891216760676873) internal successors, (1848), 1241 states have internal predecessors, (1848), 0 states have call successors, (0), 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-02-05 19:48:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1848 transitions. [2025-02-05 19:48:20,420 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1848 transitions. Word has length 141 [2025-02-05 19:48:20,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:20,421 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1848 transitions. [2025-02-05 19:48:20,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 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-02-05 19:48:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1848 transitions. [2025-02-05 19:48:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 19:48:20,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:20,423 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] [2025-02-05 19:48:20,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 19:48:20,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:20,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:20,423 INFO L85 PathProgramCache]: Analyzing trace with hash -333835232, now seen corresponding path program 1 times [2025-02-05 19:48:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:20,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857087442] [2025-02-05 19:48:20,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:20,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 19:48:20,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 19:48:20,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:20,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:20,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:20,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857087442] [2025-02-05 19:48:20,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857087442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:20,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:20,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:20,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335005804] [2025-02-05 19:48:20,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:20,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:20,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:20,954 INFO L87 Difference]: Start difference. First operand 1242 states and 1848 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 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-02-05 19:48:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:21,739 INFO L93 Difference]: Finished difference Result 2447 states and 3647 transitions. [2025-02-05 19:48:21,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-02-05 19:48:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:21,742 INFO L225 Difference]: With dead ends: 2447 [2025-02-05 19:48:21,742 INFO L226 Difference]: Without dead ends: 1345 [2025-02-05 19:48:21,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:48:21,743 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 2083 mSDsluCounter, 5903 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2083 SdHoareTripleChecker+Valid, 7380 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:21,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2083 Valid, 7380 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:48:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-02-05 19:48:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1248. [2025-02-05 19:48:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 1.4859663191659984) internal successors, (1853), 1247 states have internal predecessors, (1853), 0 states have call successors, (0), 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-02-05 19:48:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1853 transitions. [2025-02-05 19:48:21,766 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1853 transitions. Word has length 142 [2025-02-05 19:48:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:21,767 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1853 transitions. [2025-02-05 19:48:21,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 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-02-05 19:48:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1853 transitions. [2025-02-05 19:48:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 19:48:21,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:21,768 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] [2025-02-05 19:48:21,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 19:48:21,768 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:21,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1769623583, now seen corresponding path program 1 times [2025-02-05 19:48:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:21,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118446106] [2025-02-05 19:48:21,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:21,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:21,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 19:48:21,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 19:48:21,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:21,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:22,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118446106] [2025-02-05 19:48:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118446106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:22,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280058443] [2025-02-05 19:48:22,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:22,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:22,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:22,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:22,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:22,124 INFO L87 Difference]: Start difference. First operand 1248 states and 1853 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 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-02-05 19:48:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:22,727 INFO L93 Difference]: Finished difference Result 2440 states and 3634 transitions. [2025-02-05 19:48:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:22,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-02-05 19:48:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:22,730 INFO L225 Difference]: With dead ends: 2440 [2025-02-05 19:48:22,731 INFO L226 Difference]: Without dead ends: 1335 [2025-02-05 19:48:22,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:22,733 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2069 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:22,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 4440 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:48:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-02-05 19:48:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1242. [2025-02-05 19:48:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 1.4867042707493956) internal successors, (1845), 1241 states have internal predecessors, (1845), 0 states have call successors, (0), 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-02-05 19:48:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1845 transitions. [2025-02-05 19:48:22,745 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1845 transitions. Word has length 142 [2025-02-05 19:48:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:22,745 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1845 transitions. [2025-02-05 19:48:22,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 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-02-05 19:48:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1845 transitions. [2025-02-05 19:48:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 19:48:22,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:22,747 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] [2025-02-05 19:48:22,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 19:48:22,748 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:22,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:22,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1775930572, now seen corresponding path program 1 times [2025-02-05 19:48:22,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:22,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420329756] [2025-02-05 19:48:22,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:22,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:22,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 19:48:22,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 19:48:22,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:22,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420329756] [2025-02-05 19:48:23,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420329756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:23,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:23,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541212803] [2025-02-05 19:48:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:23,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:23,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:23,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:23,471 INFO L87 Difference]: Start difference. First operand 1242 states and 1845 transitions. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 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-02-05 19:48:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:24,478 INFO L93 Difference]: Finished difference Result 3304 states and 4926 transitions. [2025-02-05 19:48:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-02-05 19:48:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:24,484 INFO L225 Difference]: With dead ends: 3304 [2025-02-05 19:48:24,484 INFO L226 Difference]: Without dead ends: 2205 [2025-02-05 19:48:24,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:48:24,486 INFO L435 NwaCegarLoop]: 1474 mSDtfsCounter, 3185 mSDsluCounter, 5890 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3185 SdHoareTripleChecker+Valid, 7364 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:24,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3185 Valid, 7364 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1691 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:48:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2025-02-05 19:48:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 1252. [2025-02-05 19:48:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.4852118305355715) internal successors, (1858), 1251 states have internal predecessors, (1858), 0 states have call successors, (0), 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-02-05 19:48:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1858 transitions. [2025-02-05 19:48:24,503 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1858 transitions. Word has length 143 [2025-02-05 19:48:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:24,503 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1858 transitions. [2025-02-05 19:48:24,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 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-02-05 19:48:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1858 transitions. [2025-02-05 19:48:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 19:48:24,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:24,504 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] [2025-02-05 19:48:24,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 19:48:24,504 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:24,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1925247178, now seen corresponding path program 1 times [2025-02-05 19:48:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:24,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079686100] [2025-02-05 19:48:24,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:24,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 19:48:24,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 19:48:24,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:24,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079686100] [2025-02-05 19:48:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079686100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:24,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646331258] [2025-02-05 19:48:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:24,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:24,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:24,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:24,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:24,991 INFO L87 Difference]: Start difference. First operand 1252 states and 1858 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 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-02-05 19:48:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:25,861 INFO L93 Difference]: Finished difference Result 3308 states and 4929 transitions. [2025-02-05 19:48:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:25,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-02-05 19:48:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:25,866 INFO L225 Difference]: With dead ends: 3308 [2025-02-05 19:48:25,866 INFO L226 Difference]: Without dead ends: 2209 [2025-02-05 19:48:25,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:48:25,867 INFO L435 NwaCegarLoop]: 1475 mSDtfsCounter, 4640 mSDsluCounter, 5306 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4640 SdHoareTripleChecker+Valid, 6781 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:25,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4640 Valid, 6781 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 19:48:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2025-02-05 19:48:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1258. [2025-02-05 19:48:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4844868735083532) internal successors, (1866), 1257 states have internal predecessors, (1866), 0 states have call successors, (0), 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-02-05 19:48:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1866 transitions. [2025-02-05 19:48:25,881 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1866 transitions. Word has length 144 [2025-02-05 19:48:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:25,882 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1866 transitions. [2025-02-05 19:48:25,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 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-02-05 19:48:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1866 transitions. [2025-02-05 19:48:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 19:48:25,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:25,883 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] [2025-02-05 19:48:25,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 19:48:25,883 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:25,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1140592633, now seen corresponding path program 1 times [2025-02-05 19:48:25,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:25,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764977666] [2025-02-05 19:48:25,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:25,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:25,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 19:48:26,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 19:48:26,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:26,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:26,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:26,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764977666] [2025-02-05 19:48:26,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764977666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:26,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:26,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:26,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729947807] [2025-02-05 19:48:26,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:26,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:26,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:26,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:26,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:26,635 INFO L87 Difference]: Start difference. First operand 1258 states and 1866 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 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-02-05 19:48:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:27,650 INFO L93 Difference]: Finished difference Result 3309 states and 4930 transitions. [2025-02-05 19:48:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:27,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-02-05 19:48:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:27,656 INFO L225 Difference]: With dead ends: 3309 [2025-02-05 19:48:27,656 INFO L226 Difference]: Without dead ends: 2210 [2025-02-05 19:48:27,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:48:27,657 INFO L435 NwaCegarLoop]: 1474 mSDtfsCounter, 4565 mSDsluCounter, 5889 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4565 SdHoareTripleChecker+Valid, 7363 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:27,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4565 Valid, 7363 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1691 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:48:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2025-02-05 19:48:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 1301. [2025-02-05 19:48:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1300 states have (on average 1.4830769230769232) internal successors, (1928), 1300 states have internal predecessors, (1928), 0 states have call successors, (0), 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-02-05 19:48:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1928 transitions. [2025-02-05 19:48:27,670 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1928 transitions. Word has length 145 [2025-02-05 19:48:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:27,670 INFO L471 AbstractCegarLoop]: Abstraction has 1301 states and 1928 transitions. [2025-02-05 19:48:27,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 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-02-05 19:48:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1928 transitions. [2025-02-05 19:48:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 19:48:27,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:27,671 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] [2025-02-05 19:48:27,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 19:48:27,671 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:27,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash -89640036, now seen corresponding path program 1 times [2025-02-05 19:48:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811655561] [2025-02-05 19:48:27,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:27,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 19:48:27,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 19:48:27,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:27,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:28,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:28,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811655561] [2025-02-05 19:48:28,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811655561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:28,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:28,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439178277] [2025-02-05 19:48:28,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:28,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:28,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:28,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:28,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:28,124 INFO L87 Difference]: Start difference. First operand 1301 states and 1928 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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-02-05 19:48:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:29,073 INFO L93 Difference]: Finished difference Result 3312 states and 4932 transitions. [2025-02-05 19:48:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:29,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-02-05 19:48:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:29,083 INFO L225 Difference]: With dead ends: 3312 [2025-02-05 19:48:29,083 INFO L226 Difference]: Without dead ends: 2213 [2025-02-05 19:48:29,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:48:29,087 INFO L435 NwaCegarLoop]: 1476 mSDtfsCounter, 4609 mSDsluCounter, 5306 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4609 SdHoareTripleChecker+Valid, 6782 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:29,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4609 Valid, 6782 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:48:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2025-02-05 19:48:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1308. [2025-02-05 19:48:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1307 states have (on average 1.4820198928844683) internal successors, (1937), 1307 states have internal predecessors, (1937), 0 states have call successors, (0), 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-02-05 19:48:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1937 transitions. [2025-02-05 19:48:29,110 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1937 transitions. Word has length 146 [2025-02-05 19:48:29,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:29,110 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1937 transitions. [2025-02-05 19:48:29,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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-02-05 19:48:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1937 transitions. [2025-02-05 19:48:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 19:48:29,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:29,111 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] [2025-02-05 19:48:29,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 19:48:29,112 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:29,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2028650526, now seen corresponding path program 1 times [2025-02-05 19:48:29,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:29,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425273310] [2025-02-05 19:48:29,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:29,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 19:48:29,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 19:48:29,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:29,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:29,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:29,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425273310] [2025-02-05 19:48:29,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425273310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:29,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:29,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:29,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468313104] [2025-02-05 19:48:29,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:29,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:29,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:29,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:29,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:29,963 INFO L87 Difference]: Start difference. First operand 1308 states and 1937 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 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-02-05 19:48:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:30,503 INFO L93 Difference]: Finished difference Result 2507 states and 3721 transitions. [2025-02-05 19:48:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:30,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-02-05 19:48:30,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:30,506 INFO L225 Difference]: With dead ends: 2507 [2025-02-05 19:48:30,506 INFO L226 Difference]: Without dead ends: 1345 [2025-02-05 19:48:30,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:48:30,510 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 1890 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1890 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:30,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1890 Valid, 4440 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-02-05 19:48:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1307. [2025-02-05 19:48:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1306 states have (on average 1.4808575803981623) internal successors, (1934), 1306 states have internal predecessors, (1934), 0 states have call successors, (0), 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-02-05 19:48:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1934 transitions. [2025-02-05 19:48:30,521 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1934 transitions. Word has length 147 [2025-02-05 19:48:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:30,521 INFO L471 AbstractCegarLoop]: Abstraction has 1307 states and 1934 transitions. [2025-02-05 19:48:30,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 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-02-05 19:48:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1934 transitions. [2025-02-05 19:48:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 19:48:30,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:30,522 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] [2025-02-05 19:48:30,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 19:48:30,522 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:30,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash 33545066, now seen corresponding path program 1 times [2025-02-05 19:48:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:30,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435698931] [2025-02-05 19:48:30,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:30,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:30,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 19:48:30,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 19:48:30,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:30,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:30,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:30,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435698931] [2025-02-05 19:48:30,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435698931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:30,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:30,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:30,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347797522] [2025-02-05 19:48:30,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:30,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:30,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:30,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:30,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:30,884 INFO L87 Difference]: Start difference. First operand 1307 states and 1934 transitions. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:31,485 INFO L93 Difference]: Finished difference Result 2467 states and 3664 transitions. [2025-02-05 19:48:31,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:31,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-05 19:48:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:31,487 INFO L225 Difference]: With dead ends: 2467 [2025-02-05 19:48:31,487 INFO L226 Difference]: Without dead ends: 1330 [2025-02-05 19:48:31,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:31,489 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 16 mSDsluCounter, 7516 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9023 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:31,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9023 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:48:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-02-05 19:48:31,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1327. [2025-02-05 19:48:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1326 states have (on average 1.4788838612368025) internal successors, (1961), 1326 states have internal predecessors, (1961), 0 states have call successors, (0), 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-02-05 19:48:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1961 transitions. [2025-02-05 19:48:31,500 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1961 transitions. Word has length 148 [2025-02-05 19:48:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:31,500 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1961 transitions. [2025-02-05 19:48:31,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1961 transitions. [2025-02-05 19:48:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 19:48:31,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:31,501 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] [2025-02-05 19:48:31,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 19:48:31,501 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:31,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:31,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1678649656, now seen corresponding path program 1 times [2025-02-05 19:48:31,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:31,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563815080] [2025-02-05 19:48:31,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:31,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 19:48:31,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 19:48:31,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:31,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:31,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563815080] [2025-02-05 19:48:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563815080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:31,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:48:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856696082] [2025-02-05 19:48:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:31,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:48:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:31,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:48:31,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:48:31,895 INFO L87 Difference]: Start difference. First operand 1327 states and 1961 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 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-02-05 19:48:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:32,602 INFO L93 Difference]: Finished difference Result 2518 states and 3735 transitions. [2025-02-05 19:48:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:48:32,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 19:48:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:32,604 INFO L225 Difference]: With dead ends: 2518 [2025-02-05 19:48:32,604 INFO L226 Difference]: Without dead ends: 1359 [2025-02-05 19:48:32,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:48:32,609 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2042 mSDsluCounter, 4431 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 5910 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:32,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2042 Valid, 5910 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:48:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-02-05 19:48:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1321. [2025-02-05 19:48:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.478030303030303) internal successors, (1951), 1320 states have internal predecessors, (1951), 0 states have call successors, (0), 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-02-05 19:48:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1951 transitions. [2025-02-05 19:48:32,620 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1951 transitions. Word has length 149 [2025-02-05 19:48:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:32,620 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1951 transitions. [2025-02-05 19:48:32,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 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-02-05 19:48:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1951 transitions. [2025-02-05 19:48:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 19:48:32,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:32,621 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] [2025-02-05 19:48:32,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 19:48:32,621 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:32,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash 346390029, now seen corresponding path program 1 times [2025-02-05 19:48:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:32,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912787848] [2025-02-05 19:48:32,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:32,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:32,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 19:48:32,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 19:48:32,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:32,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:33,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912787848] [2025-02-05 19:48:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912787848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:33,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:33,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906286829] [2025-02-05 19:48:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:33,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:33,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:33,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:33,060 INFO L87 Difference]: Start difference. First operand 1321 states and 1951 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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-02-05 19:48:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:33,749 INFO L93 Difference]: Finished difference Result 2508 states and 3719 transitions. [2025-02-05 19:48:33,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:33,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 19:48:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:33,752 INFO L225 Difference]: With dead ends: 2508 [2025-02-05 19:48:33,752 INFO L226 Difference]: Without dead ends: 1359 [2025-02-05 19:48:33,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:48:33,754 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2020 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2020 SdHoareTripleChecker+Valid, 6021 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:33,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2020 Valid, 6021 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:48:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-02-05 19:48:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1321. [2025-02-05 19:48:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.4772727272727273) internal successors, (1950), 1320 states have internal predecessors, (1950), 0 states have call successors, (0), 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-02-05 19:48:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1950 transitions. [2025-02-05 19:48:33,780 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1950 transitions. Word has length 149 [2025-02-05 19:48:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:33,780 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1950 transitions. [2025-02-05 19:48:33,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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-02-05 19:48:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1950 transitions. [2025-02-05 19:48:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 19:48:33,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:33,781 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] [2025-02-05 19:48:33,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 19:48:33,782 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:33,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:33,782 INFO L85 PathProgramCache]: Analyzing trace with hash -129833905, now seen corresponding path program 1 times [2025-02-05 19:48:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:33,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910037244] [2025-02-05 19:48:33,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:33,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:33,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 19:48:33,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 19:48:33,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:33,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:34,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:34,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910037244] [2025-02-05 19:48:34,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910037244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:34,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:34,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:34,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002681400] [2025-02-05 19:48:34,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:34,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:34,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:34,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:34,180 INFO L87 Difference]: Start difference. First operand 1321 states and 1950 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 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-02-05 19:48:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:34,915 INFO L93 Difference]: Finished difference Result 2508 states and 3718 transitions. [2025-02-05 19:48:34,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:34,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-02-05 19:48:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:34,917 INFO L225 Difference]: With dead ends: 2508 [2025-02-05 19:48:34,917 INFO L226 Difference]: Without dead ends: 1363 [2025-02-05 19:48:34,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:48:34,919 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2027 mSDsluCounter, 5909 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 7388 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:34,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 7388 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:48:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-02-05 19:48:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1323. [2025-02-05 19:48:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1322 states have (on average 1.4765506807866868) internal successors, (1952), 1322 states have internal predecessors, (1952), 0 states have call successors, (0), 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-02-05 19:48:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1952 transitions. [2025-02-05 19:48:34,931 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1952 transitions. Word has length 150 [2025-02-05 19:48:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:34,931 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1952 transitions. [2025-02-05 19:48:34,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 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-02-05 19:48:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1952 transitions. [2025-02-05 19:48:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 19:48:34,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:34,932 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] [2025-02-05 19:48:34,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 19:48:34,932 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:34,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash 211703826, now seen corresponding path program 1 times [2025-02-05 19:48:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:34,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323220161] [2025-02-05 19:48:34,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:34,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 19:48:35,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 19:48:35,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:35,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:35,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323220161] [2025-02-05 19:48:35,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323220161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:35,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:35,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399821906] [2025-02-05 19:48:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:35,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:35,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:35,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:35,427 INFO L87 Difference]: Start difference. First operand 1323 states and 1952 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 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-02-05 19:48:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:36,269 INFO L93 Difference]: Finished difference Result 2506 states and 3714 transitions. [2025-02-05 19:48:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:36,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-05 19:48:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:36,272 INFO L225 Difference]: With dead ends: 2506 [2025-02-05 19:48:36,272 INFO L226 Difference]: Without dead ends: 1365 [2025-02-05 19:48:36,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:48:36,273 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2024 mSDsluCounter, 5909 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2024 SdHoareTripleChecker+Valid, 7388 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:36,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2024 Valid, 7388 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 19:48:36,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-02-05 19:48:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1325. [2025-02-05 19:48:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.4758308157099698) internal successors, (1954), 1324 states have internal predecessors, (1954), 0 states have call successors, (0), 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-02-05 19:48:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1954 transitions. [2025-02-05 19:48:36,289 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1954 transitions. Word has length 151 [2025-02-05 19:48:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:36,289 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1954 transitions. [2025-02-05 19:48:36,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 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-02-05 19:48:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1954 transitions. [2025-02-05 19:48:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 19:48:36,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:36,290 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] [2025-02-05 19:48:36,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 19:48:36,290 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:36,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1747773355, now seen corresponding path program 1 times [2025-02-05 19:48:36,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:36,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140905106] [2025-02-05 19:48:36,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:36,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 19:48:36,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 19:48:36,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:36,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:36,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140905106] [2025-02-05 19:48:36,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140905106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:36,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:36,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:36,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198192471] [2025-02-05 19:48:36,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:36,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:36,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:36,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:36,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:36,592 INFO L87 Difference]: Start difference. First operand 1325 states and 1954 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-02-05 19:48:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:37,054 INFO L93 Difference]: Finished difference Result 2512 states and 3721 transitions. [2025-02-05 19:48:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:37,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-05 19:48:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:37,057 INFO L225 Difference]: With dead ends: 2512 [2025-02-05 19:48:37,057 INFO L226 Difference]: Without dead ends: 1360 [2025-02-05 19:48:37,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:37,058 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2012 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:37,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 4440 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:48:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-02-05 19:48:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1322. [2025-02-05 19:48:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1321 states have (on average 1.4753974261922786) internal successors, (1949), 1321 states have internal predecessors, (1949), 0 states have call successors, (0), 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-02-05 19:48:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1949 transitions. [2025-02-05 19:48:37,067 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1949 transitions. Word has length 151 [2025-02-05 19:48:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:37,067 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1949 transitions. [2025-02-05 19:48:37,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-02-05 19:48:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1949 transitions. [2025-02-05 19:48:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 19:48:37,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:37,068 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] [2025-02-05 19:48:37,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 19:48:37,068 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:37,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1492196276, now seen corresponding path program 1 times [2025-02-05 19:48:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:37,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871669418] [2025-02-05 19:48:37,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:37,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:37,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 19:48:37,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 19:48:37,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:37,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:37,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:37,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871669418] [2025-02-05 19:48:37,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871669418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:37,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:37,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 19:48:37,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850000225] [2025-02-05 19:48:37,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:37,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 19:48:37,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:37,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 19:48:37,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:48:37,719 INFO L87 Difference]: Start difference. First operand 1322 states and 1949 transitions. Second operand has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 0 states have call successors, (0), 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-02-05 19:48:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:38,491 INFO L93 Difference]: Finished difference Result 2501 states and 3705 transitions. [2025-02-05 19:48:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 19:48:38,491 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-02-05 19:48:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:38,493 INFO L225 Difference]: With dead ends: 2501 [2025-02-05 19:48:38,493 INFO L226 Difference]: Without dead ends: 1364 [2025-02-05 19:48:38,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-02-05 19:48:38,494 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 2021 mSDsluCounter, 3563 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 5036 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:38,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 5036 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:48:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-02-05 19:48:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1324. [2025-02-05 19:48:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.474678760393046) internal successors, (1951), 1323 states have internal predecessors, (1951), 0 states have call successors, (0), 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-02-05 19:48:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1951 transitions. [2025-02-05 19:48:38,507 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1951 transitions. Word has length 152 [2025-02-05 19:48:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:38,507 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 1951 transitions. [2025-02-05 19:48:38,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 0 states have call successors, (0), 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-02-05 19:48:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1951 transitions. [2025-02-05 19:48:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 19:48:38,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:38,507 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] [2025-02-05 19:48:38,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 19:48:38,508 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:38,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1106762407, now seen corresponding path program 1 times [2025-02-05 19:48:38,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:38,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794679404] [2025-02-05 19:48:38,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:38,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:38,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 19:48:38,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 19:48:38,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:38,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:39,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794679404] [2025-02-05 19:48:39,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794679404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:39,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:39,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585329228] [2025-02-05 19:48:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:39,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:39,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:39,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:39,020 INFO L87 Difference]: Start difference. First operand 1324 states and 1951 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 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-02-05 19:48:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:39,572 INFO L93 Difference]: Finished difference Result 2507 states and 3712 transitions. [2025-02-05 19:48:39,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:39,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-02-05 19:48:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:39,578 INFO L225 Difference]: With dead ends: 2507 [2025-02-05 19:48:39,578 INFO L226 Difference]: Without dead ends: 1359 [2025-02-05 19:48:39,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:39,583 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2003 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:39,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 4440 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-02-05 19:48:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1321. [2025-02-05 19:48:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.4742424242424241) internal successors, (1946), 1320 states have internal predecessors, (1946), 0 states have call successors, (0), 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-02-05 19:48:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1946 transitions. [2025-02-05 19:48:39,602 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1946 transitions. Word has length 152 [2025-02-05 19:48:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:39,605 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1946 transitions. [2025-02-05 19:48:39,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 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-02-05 19:48:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1946 transitions. [2025-02-05 19:48:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 19:48:39,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:39,606 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] [2025-02-05 19:48:39,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 19:48:39,606 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:39,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash -457930601, now seen corresponding path program 1 times [2025-02-05 19:48:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:39,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722251507] [2025-02-05 19:48:39,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:39,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 19:48:39,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 19:48:39,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:39,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:40,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:40,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722251507] [2025-02-05 19:48:40,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722251507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:40,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:40,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 19:48:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73865747] [2025-02-05 19:48:40,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:40,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:48:40,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:40,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:48:40,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:48:40,105 INFO L87 Difference]: Start difference. First operand 1321 states and 1946 transitions. Second operand has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 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-02-05 19:48:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:40,687 INFO L93 Difference]: Finished difference Result 2528 states and 3743 transitions. [2025-02-05 19:48:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:48:40,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-05 19:48:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:40,693 INFO L225 Difference]: With dead ends: 2528 [2025-02-05 19:48:40,694 INFO L226 Difference]: Without dead ends: 1399 [2025-02-05 19:48:40,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:48:40,696 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 48 mSDsluCounter, 6222 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7735 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:40,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 7735 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-02-05 19:48:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1387. [2025-02-05 19:48:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1386 states have (on average 1.474025974025974) internal successors, (2043), 1386 states have internal predecessors, (2043), 0 states have call successors, (0), 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-02-05 19:48:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 2043 transitions. [2025-02-05 19:48:40,718 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 2043 transitions. Word has length 153 [2025-02-05 19:48:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:40,718 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 2043 transitions. [2025-02-05 19:48:40,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 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-02-05 19:48:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2043 transitions. [2025-02-05 19:48:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 19:48:40,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:40,719 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] [2025-02-05 19:48:40,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 19:48:40,723 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:40,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash -162224266, now seen corresponding path program 1 times [2025-02-05 19:48:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804530427] [2025-02-05 19:48:40,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:40,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:40,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 19:48:40,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 19:48:40,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:40,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:41,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804530427] [2025-02-05 19:48:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804530427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:41,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:41,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248931805] [2025-02-05 19:48:41,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:41,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:41,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:41,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:41,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:41,108 INFO L87 Difference]: Start difference. First operand 1387 states and 2043 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-02-05 19:48:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:41,601 INFO L93 Difference]: Finished difference Result 2630 states and 3893 transitions. [2025-02-05 19:48:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:41,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-05 19:48:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:41,603 INFO L225 Difference]: With dead ends: 2630 [2025-02-05 19:48:41,606 INFO L226 Difference]: Without dead ends: 1422 [2025-02-05 19:48:41,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:41,608 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 1994 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:41,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 4440 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:41,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-02-05 19:48:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1384. [2025-02-05 19:48:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.4736080983369486) internal successors, (2038), 1383 states have internal predecessors, (2038), 0 states have call successors, (0), 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-02-05 19:48:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2038 transitions. [2025-02-05 19:48:41,631 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2038 transitions. Word has length 153 [2025-02-05 19:48:41,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:41,631 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2038 transitions. [2025-02-05 19:48:41,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-02-05 19:48:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2038 transitions. [2025-02-05 19:48:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 19:48:41,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:41,632 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] [2025-02-05 19:48:41,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 19:48:41,632 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:41,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash -249468834, now seen corresponding path program 1 times [2025-02-05 19:48:41,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:41,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581929378] [2025-02-05 19:48:41,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:41,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:41,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 19:48:41,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 19:48:41,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:41,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:42,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581929378] [2025-02-05 19:48:42,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581929378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:42,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:42,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 19:48:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826024931] [2025-02-05 19:48:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:42,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:48:42,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:42,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:48:42,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:48:42,124 INFO L87 Difference]: Start difference. First operand 1384 states and 2038 transitions. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 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-02-05 19:48:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:42,984 INFO L93 Difference]: Finished difference Result 2617 states and 3873 transitions. [2025-02-05 19:48:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 19:48:42,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 19:48:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:42,987 INFO L225 Difference]: With dead ends: 2617 [2025-02-05 19:48:42,987 INFO L226 Difference]: Without dead ends: 1427 [2025-02-05 19:48:42,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-02-05 19:48:42,989 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 2016 mSDsluCounter, 6155 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 7628 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:42,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 7628 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 19:48:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-02-05 19:48:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1389. [2025-02-05 19:48:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1388 states have (on average 1.4726224783861672) internal successors, (2044), 1388 states have internal predecessors, (2044), 0 states have call successors, (0), 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-02-05 19:48:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2044 transitions. [2025-02-05 19:48:43,001 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2044 transitions. Word has length 154 [2025-02-05 19:48:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:43,001 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 2044 transitions. [2025-02-05 19:48:43,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 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-02-05 19:48:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2044 transitions. [2025-02-05 19:48:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 19:48:43,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:43,002 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] [2025-02-05 19:48:43,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 19:48:43,002 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:43,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:43,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1022946207, now seen corresponding path program 1 times [2025-02-05 19:48:43,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:43,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638263954] [2025-02-05 19:48:43,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:43,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:43,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 19:48:43,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 19:48:43,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:43,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638263954] [2025-02-05 19:48:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638263954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:43,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:43,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890936960] [2025-02-05 19:48:43,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:43,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:43,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:43,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:43,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:43,529 INFO L87 Difference]: Start difference. First operand 1389 states and 2044 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 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-02-05 19:48:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:44,064 INFO L93 Difference]: Finished difference Result 2623 states and 3880 transitions. [2025-02-05 19:48:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 19:48:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:44,067 INFO L225 Difference]: With dead ends: 2623 [2025-02-05 19:48:44,067 INFO L226 Difference]: Without dead ends: 1421 [2025-02-05 19:48:44,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:44,072 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 1987 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1987 SdHoareTripleChecker+Valid, 4434 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:44,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1987 Valid, 4434 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:44,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-02-05 19:48:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1383. [2025-02-05 19:48:44,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.47178002894356) internal successors, (2034), 1382 states have internal predecessors, (2034), 0 states have call successors, (0), 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-02-05 19:48:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2034 transitions. [2025-02-05 19:48:44,085 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2034 transitions. Word has length 154 [2025-02-05 19:48:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:44,086 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2034 transitions. [2025-02-05 19:48:44,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 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-02-05 19:48:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2034 transitions. [2025-02-05 19:48:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 19:48:44,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:44,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] [2025-02-05 19:48:44,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 19:48:44,087 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:44,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:44,088 INFO L85 PathProgramCache]: Analyzing trace with hash -205298953, now seen corresponding path program 1 times [2025-02-05 19:48:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:44,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204489298] [2025-02-05 19:48:44,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:44,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 19:48:44,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 19:48:44,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:44,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204489298] [2025-02-05 19:48:44,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204489298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:44,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:44,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 19:48:44,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447007370] [2025-02-05 19:48:44,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:44,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 19:48:44,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:44,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 19:48:44,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:48:44,762 INFO L87 Difference]: Start difference. First operand 1383 states and 2034 transitions. Second operand has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:45,894 INFO L93 Difference]: Finished difference Result 2612 states and 3863 transitions. [2025-02-05 19:48:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 19:48:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-02-05 19:48:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:45,897 INFO L225 Difference]: With dead ends: 2612 [2025-02-05 19:48:45,900 INFO L226 Difference]: Without dead ends: 1418 [2025-02-05 19:48:45,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-02-05 19:48:45,902 INFO L435 NwaCegarLoop]: 1474 mSDtfsCounter, 1984 mSDsluCounter, 11777 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 13251 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:45,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1984 Valid, 13251 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 19:48:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-02-05 19:48:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1380. [2025-02-05 19:48:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1379 states have (on average 1.4720812182741116) internal successors, (2030), 1379 states have internal predecessors, (2030), 0 states have call successors, (0), 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-02-05 19:48:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2030 transitions. [2025-02-05 19:48:45,921 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2030 transitions. Word has length 155 [2025-02-05 19:48:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:45,922 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2030 transitions. [2025-02-05 19:48:45,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2030 transitions. [2025-02-05 19:48:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 19:48:45,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:45,922 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] [2025-02-05 19:48:45,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 19:48:45,922 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:45,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 820268956, now seen corresponding path program 1 times [2025-02-05 19:48:45,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:45,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235887980] [2025-02-05 19:48:45,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:45,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:46,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 19:48:46,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 19:48:46,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:46,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:46,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:46,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235887980] [2025-02-05 19:48:46,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235887980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:46,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:46,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:48:46,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591487886] [2025-02-05 19:48:46,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:46,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:48:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:46,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:48:46,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:48:46,329 INFO L87 Difference]: Start difference. First operand 1380 states and 2030 transitions. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:47,065 INFO L93 Difference]: Finished difference Result 2595 states and 3839 transitions. [2025-02-05 19:48:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:48:47,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-02-05 19:48:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:47,067 INFO L225 Difference]: With dead ends: 2595 [2025-02-05 19:48:47,067 INFO L226 Difference]: Without dead ends: 1418 [2025-02-05 19:48:47,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:48:47,068 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 20 mSDsluCounter, 8995 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10497 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:47,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10497 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:48:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-02-05 19:48:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1414. [2025-02-05 19:48:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 1.4692144373673035) internal successors, (2076), 1413 states have internal predecessors, (2076), 0 states have call successors, (0), 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-02-05 19:48:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2076 transitions. [2025-02-05 19:48:47,077 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2076 transitions. Word has length 155 [2025-02-05 19:48:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:47,077 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2076 transitions. [2025-02-05 19:48:47,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2076 transitions. [2025-02-05 19:48:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 19:48:47,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:47,078 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] [2025-02-05 19:48:47,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 19:48:47,078 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:47,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:47,079 INFO L85 PathProgramCache]: Analyzing trace with hash -252129725, now seen corresponding path program 1 times [2025-02-05 19:48:47,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:47,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644553782] [2025-02-05 19:48:47,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:47,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 19:48:47,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 19:48:47,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:47,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:47,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:47,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644553782] [2025-02-05 19:48:47,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644553782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:47,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:47,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:47,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098178417] [2025-02-05 19:48:47,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:47,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:47,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:47,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:47,407 INFO L87 Difference]: Start difference. First operand 1414 states and 2076 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:47,892 INFO L93 Difference]: Finished difference Result 2692 states and 3972 transitions. [2025-02-05 19:48:47,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:47,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-02-05 19:48:47,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:47,894 INFO L225 Difference]: With dead ends: 2692 [2025-02-05 19:48:47,894 INFO L226 Difference]: Without dead ends: 1463 [2025-02-05 19:48:47,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:47,895 INFO L435 NwaCegarLoop]: 1480 mSDtfsCounter, 1976 mSDsluCounter, 2957 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 4437 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:47,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1976 Valid, 4437 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-02-05 19:48:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1411. [2025-02-05 19:48:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1410 states have (on average 1.4687943262411347) internal successors, (2071), 1410 states have internal predecessors, (2071), 0 states have call successors, (0), 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-02-05 19:48:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2071 transitions. [2025-02-05 19:48:47,905 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2071 transitions. Word has length 155 [2025-02-05 19:48:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:47,905 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2071 transitions. [2025-02-05 19:48:47,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:48:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2071 transitions. [2025-02-05 19:48:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 19:48:47,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:47,906 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] [2025-02-05 19:48:47,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 19:48:47,906 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:47,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1403165831, now seen corresponding path program 1 times [2025-02-05 19:48:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:47,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750933818] [2025-02-05 19:48:47,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:47,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 19:48:48,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 19:48:48,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:48,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:48,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:48,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750933818] [2025-02-05 19:48:48,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750933818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:48,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:48,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:48,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862548290] [2025-02-05 19:48:48,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:48,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:48,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:48,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:48,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:48,516 INFO L87 Difference]: Start difference. First operand 1411 states and 2071 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 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-02-05 19:48:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:49,307 INFO L93 Difference]: Finished difference Result 3531 states and 5232 transitions. [2025-02-05 19:48:49,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:49,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-02-05 19:48:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:49,310 INFO L225 Difference]: With dead ends: 3531 [2025-02-05 19:48:49,310 INFO L226 Difference]: Without dead ends: 2333 [2025-02-05 19:48:49,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:48:49,311 INFO L435 NwaCegarLoop]: 1476 mSDtfsCounter, 3110 mSDsluCounter, 5898 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3110 SdHoareTripleChecker+Valid, 7374 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:49,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3110 Valid, 7374 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:48:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2025-02-05 19:48:49,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 1448. [2025-02-05 19:48:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1447 states have (on average 1.4664823773324118) internal successors, (2122), 1447 states have internal predecessors, (2122), 0 states have call successors, (0), 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-02-05 19:48:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2122 transitions. [2025-02-05 19:48:49,322 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2122 transitions. Word has length 156 [2025-02-05 19:48:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:49,322 INFO L471 AbstractCegarLoop]: Abstraction has 1448 states and 2122 transitions. [2025-02-05 19:48:49,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 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-02-05 19:48:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2122 transitions. [2025-02-05 19:48:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 19:48:49,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:49,323 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] [2025-02-05 19:48:49,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 19:48:49,323 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:49,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash -468345478, now seen corresponding path program 1 times [2025-02-05 19:48:49,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:49,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625838609] [2025-02-05 19:48:49,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:49,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:49,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 19:48:49,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 19:48:49,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:49,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625838609] [2025-02-05 19:48:49,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625838609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:49,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:49,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:49,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535410906] [2025-02-05 19:48:49,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:49,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:49,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:49,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:49,751 INFO L87 Difference]: Start difference. First operand 1448 states and 2122 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 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-02-05 19:48:50,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:50,660 INFO L93 Difference]: Finished difference Result 3535 states and 5235 transitions. [2025-02-05 19:48:50,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:50,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-02-05 19:48:50,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:50,663 INFO L225 Difference]: With dead ends: 3535 [2025-02-05 19:48:50,663 INFO L226 Difference]: Without dead ends: 2337 [2025-02-05 19:48:50,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:48:50,664 INFO L435 NwaCegarLoop]: 1475 mSDtfsCounter, 4537 mSDsluCounter, 5579 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4537 SdHoareTripleChecker+Valid, 7054 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:50,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4537 Valid, 7054 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 19:48:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2025-02-05 19:48:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1454. [2025-02-05 19:48:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1453 states have (on average 1.4659325533379215) internal successors, (2130), 1453 states have internal predecessors, (2130), 0 states have call successors, (0), 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-02-05 19:48:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2130 transitions. [2025-02-05 19:48:50,678 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2130 transitions. Word has length 157 [2025-02-05 19:48:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:50,678 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 2130 transitions. [2025-02-05 19:48:50,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 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-02-05 19:48:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2130 transitions. [2025-02-05 19:48:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 19:48:50,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:50,679 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] [2025-02-05 19:48:50,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 19:48:50,679 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:50,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1703385758, now seen corresponding path program 1 times [2025-02-05 19:48:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:50,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936477659] [2025-02-05 19:48:50,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:50,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 19:48:50,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 19:48:50,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:50,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:51,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:51,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936477659] [2025-02-05 19:48:51,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936477659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:51,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:51,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728751138] [2025-02-05 19:48:51,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:51,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:51,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:51,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:51,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:51,065 INFO L87 Difference]: Start difference. First operand 1454 states and 2130 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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-02-05 19:48:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:51,739 INFO L93 Difference]: Finished difference Result 3532 states and 5229 transitions. [2025-02-05 19:48:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:51,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-02-05 19:48:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:51,742 INFO L225 Difference]: With dead ends: 3532 [2025-02-05 19:48:51,742 INFO L226 Difference]: Without dead ends: 2327 [2025-02-05 19:48:51,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:51,743 INFO L435 NwaCegarLoop]: 1478 mSDtfsCounter, 4515 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4515 SdHoareTripleChecker+Valid, 4430 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:51,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4515 Valid, 4430 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:48:51,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2025-02-05 19:48:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 1449. [2025-02-05 19:48:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1448 states have (on average 1.4654696132596685) internal successors, (2122), 1448 states have internal predecessors, (2122), 0 states have call successors, (0), 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-02-05 19:48:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2122 transitions. [2025-02-05 19:48:51,770 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2122 transitions. Word has length 158 [2025-02-05 19:48:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:51,770 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 2122 transitions. [2025-02-05 19:48:51,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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-02-05 19:48:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2122 transitions. [2025-02-05 19:48:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 19:48:51,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:51,771 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] [2025-02-05 19:48:51,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 19:48:51,771 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:51,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:51,771 INFO L85 PathProgramCache]: Analyzing trace with hash -811688226, now seen corresponding path program 1 times [2025-02-05 19:48:51,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663594804] [2025-02-05 19:48:51,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:51,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 19:48:51,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 19:48:51,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:51,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:52,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:52,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663594804] [2025-02-05 19:48:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663594804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:52,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:52,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:48:52,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988426170] [2025-02-05 19:48:52,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:52,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:48:52,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:52,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:48:52,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:48:52,414 INFO L87 Difference]: Start difference. First operand 1449 states and 2122 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 0 states have call successors, (0), 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-02-05 19:48:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:53,435 INFO L93 Difference]: Finished difference Result 3529 states and 5225 transitions. [2025-02-05 19:48:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:48:53,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-02-05 19:48:53,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:53,438 INFO L225 Difference]: With dead ends: 3529 [2025-02-05 19:48:53,438 INFO L226 Difference]: Without dead ends: 2331 [2025-02-05 19:48:53,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-05 19:48:53,440 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 4520 mSDsluCounter, 8192 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 9665 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:53,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 9665 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 19:48:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2025-02-05 19:48:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 1452. [2025-02-05 19:48:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1451 states have (on average 1.4651964162646451) internal successors, (2126), 1451 states have internal predecessors, (2126), 0 states have call successors, (0), 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-02-05 19:48:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2126 transitions. [2025-02-05 19:48:53,451 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2126 transitions. Word has length 158 [2025-02-05 19:48:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:53,451 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 2126 transitions. [2025-02-05 19:48:53,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 0 states have call successors, (0), 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-02-05 19:48:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2126 transitions. [2025-02-05 19:48:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 19:48:53,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:53,452 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] [2025-02-05 19:48:53,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 19:48:53,453 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:53,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash 772880550, now seen corresponding path program 1 times [2025-02-05 19:48:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282648308] [2025-02-05 19:48:53,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:53,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 19:48:53,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 19:48:53,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:53,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:53,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:53,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282648308] [2025-02-05 19:48:53,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282648308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:53,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:53,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:53,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044889305] [2025-02-05 19:48:53,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:53,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:53,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:53,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:53,796 INFO L87 Difference]: Start difference. First operand 1452 states and 2126 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 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-02-05 19:48:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:54,446 INFO L93 Difference]: Finished difference Result 3524 states and 5217 transitions. [2025-02-05 19:48:54,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:54,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-05 19:48:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:54,449 INFO L225 Difference]: With dead ends: 3524 [2025-02-05 19:48:54,449 INFO L226 Difference]: Without dead ends: 2326 [2025-02-05 19:48:54,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:54,451 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 4504 mSDsluCounter, 2951 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4504 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:54,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4504 Valid, 4428 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:48:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2025-02-05 19:48:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 1452. [2025-02-05 19:48:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1451 states have (on average 1.4645072363886975) internal successors, (2125), 1451 states have internal predecessors, (2125), 0 states have call successors, (0), 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-02-05 19:48:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2125 transitions. [2025-02-05 19:48:54,463 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2125 transitions. Word has length 159 [2025-02-05 19:48:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:54,463 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 2125 transitions. [2025-02-05 19:48:54,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 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-02-05 19:48:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2125 transitions. [2025-02-05 19:48:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 19:48:54,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:54,464 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] [2025-02-05 19:48:54,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 19:48:54,464 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:54,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1076899201, now seen corresponding path program 1 times [2025-02-05 19:48:54,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:54,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164037298] [2025-02-05 19:48:54,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:54,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 19:48:54,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 19:48:54,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:54,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:55,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:55,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164037298] [2025-02-05 19:48:55,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164037298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:55,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:55,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:48:55,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664418219] [2025-02-05 19:48:55,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:55,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:48:55,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:55,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:48:55,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:48:55,035 INFO L87 Difference]: Start difference. First operand 1452 states and 2125 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 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-02-05 19:48:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:55,923 INFO L93 Difference]: Finished difference Result 2661 states and 3927 transitions. [2025-02-05 19:48:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:48:55,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-05 19:48:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:55,925 INFO L225 Difference]: With dead ends: 2661 [2025-02-05 19:48:55,925 INFO L226 Difference]: Without dead ends: 1463 [2025-02-05 19:48:55,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:48:55,927 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 1874 mSDsluCounter, 7386 mSDsCounter, 0 mSdLazyCounter, 2000 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 8865 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:55,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 8865 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2000 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 19:48:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-02-05 19:48:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1455. [2025-02-05 19:48:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1454 states have (on average 1.4642365887207702) internal successors, (2129), 1454 states have internal predecessors, (2129), 0 states have call successors, (0), 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-02-05 19:48:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2129 transitions. [2025-02-05 19:48:55,937 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2129 transitions. Word has length 159 [2025-02-05 19:48:55,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:55,938 INFO L471 AbstractCegarLoop]: Abstraction has 1455 states and 2129 transitions. [2025-02-05 19:48:55,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 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-02-05 19:48:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2129 transitions. [2025-02-05 19:48:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 19:48:55,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:55,938 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] [2025-02-05 19:48:55,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 19:48:55,939 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:55,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash -706643773, now seen corresponding path program 1 times [2025-02-05 19:48:55,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:55,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105298027] [2025-02-05 19:48:55,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:55,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:55,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 19:48:56,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 19:48:56,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:56,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:56,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:56,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105298027] [2025-02-05 19:48:56,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105298027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:56,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:56,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:48:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107306826] [2025-02-05 19:48:56,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:56,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:48:56,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:56,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:48:56,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:56,456 INFO L87 Difference]: Start difference. First operand 1455 states and 2129 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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-02-05 19:48:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:57,023 INFO L93 Difference]: Finished difference Result 2657 states and 3921 transitions. [2025-02-05 19:48:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:48:57,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-02-05 19:48:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:57,025 INFO L225 Difference]: With dead ends: 2657 [2025-02-05 19:48:57,025 INFO L226 Difference]: Without dead ends: 1459 [2025-02-05 19:48:57,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:57,026 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 17 mSDsluCounter, 5980 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7482 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:57,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7482 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:48:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-02-05 19:48:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1457. [2025-02-05 19:48:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1456 states have (on average 1.463598901098901) internal successors, (2131), 1456 states have internal predecessors, (2131), 0 states have call successors, (0), 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-02-05 19:48:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2131 transitions. [2025-02-05 19:48:57,040 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2131 transitions. Word has length 160 [2025-02-05 19:48:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:57,040 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 2131 transitions. [2025-02-05 19:48:57,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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-02-05 19:48:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2131 transitions. [2025-02-05 19:48:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 19:48:57,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:57,041 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] [2025-02-05 19:48:57,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 19:48:57,041 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:57,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash -956302134, now seen corresponding path program 1 times [2025-02-05 19:48:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051670680] [2025-02-05 19:48:57,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:57,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 19:48:57,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 19:48:57,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:57,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:57,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051670680] [2025-02-05 19:48:57,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051670680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:57,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:57,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:48:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714954334] [2025-02-05 19:48:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:57,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:48:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:57,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:48:57,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:48:57,379 INFO L87 Difference]: Start difference. First operand 1457 states and 2131 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 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-02-05 19:48:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:58,076 INFO L93 Difference]: Finished difference Result 3529 states and 5220 transitions. [2025-02-05 19:48:58,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:48:58,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-02-05 19:48:58,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:58,078 INFO L225 Difference]: With dead ends: 3529 [2025-02-05 19:48:58,078 INFO L226 Difference]: Without dead ends: 2329 [2025-02-05 19:48:58,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:48:58,080 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 4495 mSDsluCounter, 2951 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4495 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:58,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4495 Valid, 4428 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:48:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2025-02-05 19:48:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1457. [2025-02-05 19:48:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1456 states have (on average 1.4629120879120878) internal successors, (2130), 1456 states have internal predecessors, (2130), 0 states have call successors, (0), 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-02-05 19:48:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2130 transitions. [2025-02-05 19:48:58,092 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2130 transitions. Word has length 160 [2025-02-05 19:48:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:58,092 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 2130 transitions. [2025-02-05 19:48:58,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 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-02-05 19:48:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2130 transitions. [2025-02-05 19:48:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 19:48:58,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:58,093 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] [2025-02-05 19:48:58,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 19:48:58,093 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:58,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1931062788, now seen corresponding path program 1 times [2025-02-05 19:48:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:58,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708964351] [2025-02-05 19:48:58,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:58,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 19:48:58,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 19:48:58,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:58,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:58,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:58,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708964351] [2025-02-05 19:48:58,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708964351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:58,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:58,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 19:48:58,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201963077] [2025-02-05 19:48:58,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:58,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 19:48:58,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:58,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 19:48:58,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 19:48:58,374 INFO L87 Difference]: Start difference. First operand 1457 states and 2130 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-02-05 19:48:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:48:58,691 INFO L93 Difference]: Finished difference Result 2657 states and 3918 transitions. [2025-02-05 19:48:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 19:48:58,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-02-05 19:48:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:48:58,693 INFO L225 Difference]: With dead ends: 2657 [2025-02-05 19:48:58,693 INFO L226 Difference]: Without dead ends: 1457 [2025-02-05 19:48:58,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 19:48:58,694 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:48:58,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3011 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:48:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-02-05 19:48:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2025-02-05 19:48:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1456 states have (on average 1.4622252747252746) internal successors, (2129), 1456 states have internal predecessors, (2129), 0 states have call successors, (0), 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-02-05 19:48:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2129 transitions. [2025-02-05 19:48:58,707 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2129 transitions. Word has length 161 [2025-02-05 19:48:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:48:58,707 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 2129 transitions. [2025-02-05 19:48:58,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-02-05 19:48:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2129 transitions. [2025-02-05 19:48:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 19:48:58,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:48:58,708 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] [2025-02-05 19:48:58,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 19:48:58,708 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:48:58,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:48:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1323128479, now seen corresponding path program 1 times [2025-02-05 19:48:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:48:58,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500872945] [2025-02-05 19:48:58,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:48:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:48:58,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 19:48:58,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 19:48:58,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:48:58,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:48:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:48:59,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:48:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500872945] [2025-02-05 19:48:59,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500872945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:48:59,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:48:59,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 19:48:59,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296952507] [2025-02-05 19:48:59,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:48:59,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 19:48:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:48:59,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 19:48:59,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:48:59,561 INFO L87 Difference]: Start difference. First operand 1457 states and 2129 transitions. Second operand has 12 states, 12 states have (on average 13.416666666666666) internal successors, (161), 12 states have internal predecessors, (161), 0 states have call successors, (0), 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-02-05 19:49:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:49:00,728 INFO L93 Difference]: Finished difference Result 2672 states and 3939 transitions. [2025-02-05 19:49:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 19:49:00,728 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.416666666666666) internal successors, (161), 12 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-02-05 19:49:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:49:00,730 INFO L225 Difference]: With dead ends: 2672 [2025-02-05 19:49:00,730 INFO L226 Difference]: Without dead ends: 1472 [2025-02-05 19:49:00,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:49:00,731 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 5 mSDsluCounter, 13421 mSDsCounter, 0 mSdLazyCounter, 3249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14916 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:49:00,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14916 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3249 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 19:49:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2025-02-05 19:49:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1469. [2025-02-05 19:49:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1468 states have (on average 1.4632152588555858) internal successors, (2148), 1468 states have internal predecessors, (2148), 0 states have call successors, (0), 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-02-05 19:49:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2148 transitions. [2025-02-05 19:49:00,740 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2148 transitions. Word has length 161 [2025-02-05 19:49:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:49:00,740 INFO L471 AbstractCegarLoop]: Abstraction has 1469 states and 2148 transitions. [2025-02-05 19:49:00,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.416666666666666) internal successors, (161), 12 states have internal predecessors, (161), 0 states have call successors, (0), 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-02-05 19:49:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2148 transitions. [2025-02-05 19:49:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 19:49:00,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:49:00,741 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] [2025-02-05 19:49:00,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 19:49:00,741 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:49:00,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:49:00,741 INFO L85 PathProgramCache]: Analyzing trace with hash -150120725, now seen corresponding path program 1 times [2025-02-05 19:49:00,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:49:00,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394501310] [2025-02-05 19:49:00,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:49:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:49:00,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 19:49:00,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 19:49:00,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:49:00,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:49:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:49:02,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:49:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394501310] [2025-02-05 19:49:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394501310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:49:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:49:02,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-02-05 19:49:02,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100208571] [2025-02-05 19:49:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:49:02,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 19:49:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:49:02,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 19:49:02,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 19:49:02,855 INFO L87 Difference]: Start difference. First operand 1469 states and 2148 transitions. Second operand has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 0 states have call successors, (0), 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-02-05 19:49:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:49:07,283 INFO L93 Difference]: Finished difference Result 2773 states and 4083 transitions. [2025-02-05 19:49:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 19:49:07,283 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 19:49:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:49:07,285 INFO L225 Difference]: With dead ends: 2773 [2025-02-05 19:49:07,285 INFO L226 Difference]: Without dead ends: 1517 [2025-02-05 19:49:07,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 19:49:07,287 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 27 mSDsluCounter, 47285 mSDsCounter, 0 mSdLazyCounter, 12393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48766 SdHoareTripleChecker+Invalid, 12393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:49:07,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48766 Invalid, 12393 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 12393 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-05 19:49:07,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-02-05 19:49:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1504. [2025-02-05 19:49:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 1.4683965402528276) internal successors, (2207), 1503 states have internal predecessors, (2207), 0 states have call successors, (0), 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-02-05 19:49:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2207 transitions. [2025-02-05 19:49:07,299 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2207 transitions. Word has length 162 [2025-02-05 19:49:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:49:07,299 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 2207 transitions. [2025-02-05 19:49:07,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 0 states have call successors, (0), 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-02-05 19:49:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2207 transitions. [2025-02-05 19:49:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 19:49:07,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:49:07,300 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] [2025-02-05 19:49:07,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 19:49:07,300 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:49:07,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:49:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash -594037921, now seen corresponding path program 1 times [2025-02-05 19:49:07,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:49:07,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841042668] [2025-02-05 19:49:07,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:49:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:49:07,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 19:49:07,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 19:49:07,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:49:07,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:49:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:49:08,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:49:08,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841042668] [2025-02-05 19:49:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841042668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:49:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:49:08,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 19:49:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555551230] [2025-02-05 19:49:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:49:08,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 19:49:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:49:08,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 19:49:08,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2025-02-05 19:49:08,400 INFO L87 Difference]: Start difference. First operand 1504 states and 2207 transitions. Second operand has 23 states, 23 states have (on average 7.043478260869565) internal successors, (162), 23 states have internal predecessors, (162), 0 states have call successors, (0), 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-02-05 19:49:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:49:11,219 INFO L93 Difference]: Finished difference Result 2894 states and 4271 transitions. [2025-02-05 19:49:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 19:49:11,220 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.043478260869565) internal successors, (162), 23 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 19:49:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:49:11,221 INFO L225 Difference]: With dead ends: 2894 [2025-02-05 19:49:11,221 INFO L226 Difference]: Without dead ends: 1608 [2025-02-05 19:49:11,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2025-02-05 19:49:11,223 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 65 mSDsluCounter, 31448 mSDsCounter, 0 mSdLazyCounter, 7888 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 32949 SdHoareTripleChecker+Invalid, 7890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:49:11,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 32949 Invalid, 7890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7888 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 19:49:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2025-02-05 19:49:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1596. [2025-02-05 19:49:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1595 states have (on average 1.4683385579937305) internal successors, (2342), 1595 states have internal predecessors, (2342), 0 states have call successors, (0), 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-02-05 19:49:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2342 transitions. [2025-02-05 19:49:11,233 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2342 transitions. Word has length 162 [2025-02-05 19:49:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:49:11,234 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2342 transitions. [2025-02-05 19:49:11,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.043478260869565) internal successors, (162), 23 states have internal predecessors, (162), 0 states have call successors, (0), 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-02-05 19:49:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2342 transitions. [2025-02-05 19:49:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 19:49:11,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:49:11,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 19:49:11,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 19:49:11,235 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:49:11,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:49:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1060682434, now seen corresponding path program 1 times [2025-02-05 19:49:11,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:49:11,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841688994] [2025-02-05 19:49:11,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:49:11,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:49:11,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 19:49:11,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 19:49:11,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:49:11,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 19:49:11,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 19:49:11,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 19:49:11,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 19:49:11,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:49:11,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 19:49:11,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 19:49:11,628 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 19:49:11,629 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 19:49:11,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 19:49:11,632 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-05 19:49:11,711 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 19:49:11,735 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 19:49:11,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 07:49:11 BoogieIcfgContainer [2025-02-05 19:49:11,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 19:49:11,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 19:49:11,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 19:49:11,740 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 19:49:11,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:47:58" (3/4) ... [2025-02-05 19:49:11,742 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 19:49:11,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 19:49:11,744 INFO L158 Benchmark]: Toolchain (without parser) took 79030.80ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 108.6MB in the beginning and 909.1MB in the end (delta: -800.5MB). Peak memory consumption was 808.4MB. Max. memory is 16.1GB. [2025-02-05 19:49:11,744 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:49:11,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 827.59ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 71.7MB in the end (delta: 36.4MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2025-02-05 19:49:11,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 555.51ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 71.7MB in the beginning and 244.9MB in the end (delta: -173.2MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2025-02-05 19:49:11,744 INFO L158 Benchmark]: Boogie Preprocessor took 479.17ms. Allocated memory is still 369.1MB. Free memory was 244.9MB in the beginning and 202.5MB in the end (delta: 42.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2025-02-05 19:49:11,745 INFO L158 Benchmark]: IcfgBuilder took 4002.09ms. Allocated memory was 369.1MB in the beginning and 738.2MB in the end (delta: 369.1MB). Free memory was 202.5MB in the beginning and 378.9MB in the end (delta: -176.4MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2025-02-05 19:49:11,745 INFO L158 Benchmark]: TraceAbstraction took 73150.06ms. Allocated memory was 738.2MB in the beginning and 1.7GB in the end (delta: 1.0GB). Free memory was 378.9MB in the beginning and 909.2MB in the end (delta: -530.2MB). Peak memory consumption was 471.0MB. Max. memory is 16.1GB. [2025-02-05 19:49:11,745 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 1.7GB. Free memory was 909.2MB in the beginning and 909.1MB in the end (delta: 100.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 19:49:11,745 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 827.59ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 71.7MB in the end (delta: 36.4MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 555.51ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 71.7MB in the beginning and 244.9MB in the end (delta: -173.2MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 479.17ms. Allocated memory is still 369.1MB. Free memory was 244.9MB in the beginning and 202.5MB in the end (delta: 42.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * IcfgBuilder took 4002.09ms. Allocated memory was 369.1MB in the beginning and 738.2MB in the end (delta: 369.1MB). Free memory was 202.5MB in the beginning and 378.9MB in the end (delta: -176.4MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. * TraceAbstraction took 73150.06ms. Allocated memory was 738.2MB in the beginning and 1.7GB in the end (delta: 1.0GB). Free memory was 378.9MB in the beginning and 909.2MB in the end (delta: -530.2MB). Peak memory consumption was 471.0MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 1.7GB. Free memory was 909.2MB in the beginning and 909.1MB in the end (delta: 100.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 531, overapproximation of bitwiseAnd at line 539, overapproximation of bitwiseAnd at line 490. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_32 = 8; [L48] const SORT_21 var_35 = 16; [L49] const SORT_21 var_38 = 32; [L50] const SORT_21 var_41 = 64; [L51] const SORT_21 var_44 = 0; [L52] const SORT_3 var_101 = 1; [L53] const SORT_3 var_105 = 0; [L54] const SORT_6 var_190 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_412; [L72] SORT_3 input_434; [L73] SORT_3 input_449; [L74] SORT_3 input_464; [L75] SORT_3 input_479; [L76] SORT_3 input_494; [L77] SORT_3 input_509; [L78] SORT_3 input_524; [L79] SORT_3 input_539; [L80] SORT_3 input_554; [L81] SORT_3 input_569; [L82] SORT_3 input_584; [L83] SORT_3 input_599; [L84] SORT_3 input_614; [L85] SORT_3 input_629; [L86] SORT_3 input_644; [L87] SORT_3 input_660; [L88] SORT_3 input_662; [L89] SORT_3 input_664; [L90] SORT_3 input_666; [L91] SORT_3 input_668; [L92] SORT_3 input_670; [L93] SORT_3 input_672; [L94] SORT_3 input_674; [L95] SORT_3 input_679; [L96] SORT_21 input_724; [L97] SORT_21 input_725; [L98] SORT_21 input_726; [L99] SORT_21 input_727; [L100] SORT_21 input_730; [L101] SORT_21 input_734; [L102] SORT_21 input_738; [L103] SORT_21 input_746; [L104] SORT_21 input_750; [L105] SORT_21 input_752; [L106] SORT_21 input_756; [L107] SORT_21 input_759; [L108] SORT_21 input_763; [L109] SORT_21 input_768; [L110] SORT_21 input_772; [L111] SORT_21 input_777; [L112] SORT_21 input_779; [L113] SORT_21 input_780; [L114] SORT_21 input_782; [L115] SORT_21 input_786; [L116] SORT_21 input_791; [L117] SORT_21 input_798; [L118] SORT_21 input_799; [L119] SORT_21 input_801; [L120] SORT_21 input_805; [L121] SORT_21 input_810; [L122] SORT_21 input_812; [L123] SORT_21 input_813; [L124] SORT_21 input_815; [L125] SORT_21 input_819; [L126] SORT_21 input_824; [L127] SORT_21 input_828; [L128] SORT_21 input_833; [L129] SORT_21 input_835; [L130] SORT_21 input_841; [L131] SORT_21 input_853; [L132] SORT_3 input_858; [L133] SORT_3 input_867; [L134] SORT_3 input_886; [L135] SORT_3 input_893; [L136] SORT_3 input_904; [L137] SORT_3 input_910; [L138] SORT_3 input_916; [L139] SORT_3 input_922; [L140] SORT_3 input_928; [L141] SORT_3 input_934; [L142] SORT_3 input_940; [L143] SORT_3 input_946; [L144] SORT_3 input_952; [L145] SORT_3 input_958; [L146] SORT_3 input_964; [L147] SORT_3 input_970; [L148] SORT_3 input_976; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L151] SORT_21 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L152] SORT_3 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L153] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L154] SORT_3 state_110 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L155] SORT_3 state_114 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L156] SORT_3 state_118 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L157] SORT_3 state_122 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L158] SORT_3 state_138 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L159] SORT_3 state_155 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L160] SORT_3 state_158 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L161] SORT_3 state_160 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L162] SORT_3 state_164 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L163] SORT_3 state_168 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L164] SORT_3 state_173 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L165] SORT_3 state_176 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L166] SORT_3 state_186 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L167] SORT_3 state_193 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L168] SORT_3 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L169] SORT_3 state_205 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L170] SORT_3 state_210 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L171] SORT_3 state_213 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L172] SORT_3 state_225 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L173] SORT_3 state_235 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L174] SORT_3 state_240 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L175] SORT_3 state_243 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L176] SORT_3 state_252 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L177] SORT_3 state_265 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L178] SORT_3 state_278 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_21 init_52_arg_1 = var_22; [L183] state_51 = init_52_arg_1 [L184] SORT_3 init_107_arg_1 = var_105; [L185] state_106 = init_107_arg_1 [L186] SORT_3 init_109_arg_1 = var_105; [L187] state_108 = init_109_arg_1 [L188] SORT_3 init_111_arg_1 = var_105; [L189] state_110 = init_111_arg_1 [L190] SORT_3 init_115_arg_1 = var_105; [L191] state_114 = init_115_arg_1 [L192] SORT_3 init_119_arg_1 = var_105; [L193] state_118 = init_119_arg_1 [L194] SORT_3 init_123_arg_1 = var_105; [L195] state_122 = init_123_arg_1 [L196] SORT_3 init_139_arg_1 = var_105; [L197] state_138 = init_139_arg_1 [L198] SORT_3 init_156_arg_1 = var_105; [L199] state_155 = init_156_arg_1 [L200] SORT_3 init_159_arg_1 = var_105; [L201] state_158 = init_159_arg_1 [L202] SORT_3 init_161_arg_1 = var_105; [L203] state_160 = init_161_arg_1 [L204] SORT_3 init_165_arg_1 = var_105; [L205] state_164 = init_165_arg_1 [L206] SORT_3 init_169_arg_1 = var_105; [L207] state_168 = init_169_arg_1 [L208] SORT_3 init_174_arg_1 = var_105; [L209] state_173 = init_174_arg_1 [L210] SORT_3 init_177_arg_1 = var_105; [L211] state_176 = init_177_arg_1 [L212] SORT_3 init_187_arg_1 = var_105; [L213] state_186 = init_187_arg_1 [L214] SORT_3 init_194_arg_1 = var_105; [L215] state_193 = init_194_arg_1 [L216] SORT_3 init_197_arg_1 = var_105; [L217] state_196 = init_197_arg_1 [L218] SORT_3 init_206_arg_1 = var_105; [L219] state_205 = init_206_arg_1 [L220] SORT_3 init_211_arg_1 = var_105; [L221] state_210 = init_211_arg_1 [L222] SORT_3 init_214_arg_1 = var_105; [L223] state_213 = init_214_arg_1 [L224] SORT_3 init_226_arg_1 = var_105; [L225] state_225 = init_226_arg_1 [L226] SORT_3 init_236_arg_1 = var_105; [L227] state_235 = init_236_arg_1 [L228] SORT_3 init_241_arg_1 = var_105; [L229] state_240 = init_241_arg_1 [L230] SORT_3 init_244_arg_1 = var_105; [L231] state_243 = init_244_arg_1 [L232] SORT_3 init_253_arg_1 = var_105; [L233] state_252 = init_253_arg_1 [L234] SORT_3 init_266_arg_1 = var_105; [L235] state_265 = init_266_arg_1 [L236] SORT_3 init_279_arg_1 = var_105; [L237] state_278 = init_279_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_412 = __VERIFIER_nondet_uchar() [L257] input_434 = __VERIFIER_nondet_uchar() [L258] input_449 = __VERIFIER_nondet_uchar() [L259] input_464 = __VERIFIER_nondet_uchar() [L260] input_479 = __VERIFIER_nondet_uchar() [L261] input_494 = __VERIFIER_nondet_uchar() [L262] input_509 = __VERIFIER_nondet_uchar() [L263] input_524 = __VERIFIER_nondet_uchar() [L264] input_539 = __VERIFIER_nondet_uchar() [L265] input_554 = __VERIFIER_nondet_uchar() [L266] input_569 = __VERIFIER_nondet_uchar() [L267] input_584 = __VERIFIER_nondet_uchar() [L268] input_599 = __VERIFIER_nondet_uchar() [L269] input_614 = __VERIFIER_nondet_uchar() [L270] input_629 = __VERIFIER_nondet_uchar() [L271] input_644 = __VERIFIER_nondet_uchar() [L272] input_660 = __VERIFIER_nondet_uchar() [L273] input_662 = __VERIFIER_nondet_uchar() [L274] input_664 = __VERIFIER_nondet_uchar() [L275] input_666 = __VERIFIER_nondet_uchar() [L276] input_668 = __VERIFIER_nondet_uchar() [L277] input_670 = __VERIFIER_nondet_uchar() [L278] input_672 = __VERIFIER_nondet_uchar() [L279] input_674 = __VERIFIER_nondet_uchar() [L280] input_679 = __VERIFIER_nondet_uchar() [L281] input_724 = __VERIFIER_nondet_uchar() [L282] input_725 = __VERIFIER_nondet_uchar() [L283] input_726 = __VERIFIER_nondet_uchar() [L284] input_727 = __VERIFIER_nondet_uchar() [L285] input_730 = __VERIFIER_nondet_uchar() [L286] input_734 = __VERIFIER_nondet_uchar() [L287] input_738 = __VERIFIER_nondet_uchar() [L288] input_746 = __VERIFIER_nondet_uchar() [L289] input_750 = __VERIFIER_nondet_uchar() [L290] input_752 = __VERIFIER_nondet_uchar() [L291] input_756 = __VERIFIER_nondet_uchar() [L292] input_759 = __VERIFIER_nondet_uchar() [L293] input_763 = __VERIFIER_nondet_uchar() [L294] input_768 = __VERIFIER_nondet_uchar() [L295] input_772 = __VERIFIER_nondet_uchar() [L296] input_777 = __VERIFIER_nondet_uchar() [L297] input_779 = __VERIFIER_nondet_uchar() [L298] input_780 = __VERIFIER_nondet_uchar() [L299] input_782 = __VERIFIER_nondet_uchar() [L300] input_786 = __VERIFIER_nondet_uchar() [L301] input_791 = __VERIFIER_nondet_uchar() [L302] input_798 = __VERIFIER_nondet_uchar() [L303] input_799 = __VERIFIER_nondet_uchar() [L304] input_801 = __VERIFIER_nondet_uchar() [L305] input_805 = __VERIFIER_nondet_uchar() [L306] input_810 = __VERIFIER_nondet_uchar() [L307] input_812 = __VERIFIER_nondet_uchar() [L308] input_813 = __VERIFIER_nondet_uchar() [L309] input_815 = __VERIFIER_nondet_uchar() [L310] input_819 = __VERIFIER_nondet_uchar() [L311] input_824 = __VERIFIER_nondet_uchar() [L312] input_828 = __VERIFIER_nondet_uchar() [L313] input_833 = __VERIFIER_nondet_uchar() [L314] input_835 = __VERIFIER_nondet_uchar() [L315] input_841 = __VERIFIER_nondet_uchar() [L316] input_853 = __VERIFIER_nondet_uchar() [L317] input_858 = __VERIFIER_nondet_uchar() [L318] input_867 = __VERIFIER_nondet_uchar() [L319] input_886 = __VERIFIER_nondet_uchar() [L320] input_893 = __VERIFIER_nondet_uchar() [L321] input_904 = __VERIFIER_nondet_uchar() [L322] input_910 = __VERIFIER_nondet_uchar() [L323] input_916 = __VERIFIER_nondet_uchar() [L324] input_922 = __VERIFIER_nondet_uchar() [L325] input_928 = __VERIFIER_nondet_uchar() [L326] input_934 = __VERIFIER_nondet_uchar() [L327] input_940 = __VERIFIER_nondet_uchar() [L328] input_946 = __VERIFIER_nondet_uchar() [L329] input_952 = __VERIFIER_nondet_uchar() [L330] input_958 = __VERIFIER_nondet_uchar() [L331] input_964 = __VERIFIER_nondet_uchar() [L332] input_970 = __VERIFIER_nondet_uchar() [L333] input_976 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_3 var_31_arg_0 = var_28; [L349] SORT_3 var_31_arg_1 = var_30; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_31_arg_0=1, var_31_arg_1=0, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L350] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L350] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L351] SORT_21 var_33_arg_0 = state_23; [L352] SORT_21 var_33_arg_1 = var_32; [L353] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L354] SORT_3 var_34_arg_0 = var_31; [L355] SORT_3 var_34_arg_1 = var_33; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_34_arg_0=1, var_34_arg_1=0, var_35=16, var_38=32, var_41=64, var_44=0] [L356] EXPR var_34_arg_0 | var_34_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L356] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L357] SORT_21 var_36_arg_0 = state_23; [L358] SORT_21 var_36_arg_1 = var_35; [L359] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L360] SORT_3 var_37_arg_0 = var_34; [L361] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_37_arg_0=1, var_37_arg_1=0, var_38=32, var_41=64, var_44=0] [L362] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L362] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L363] SORT_21 var_39_arg_0 = state_23; [L364] SORT_21 var_39_arg_1 = var_38; [L365] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L366] SORT_3 var_40_arg_0 = var_37; [L367] SORT_3 var_40_arg_1 = var_39; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_40_arg_0=1, var_40_arg_1=0, var_41=64, var_44=0] [L368] EXPR var_40_arg_0 | var_40_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L368] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_41; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_40; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_43_arg_0=1, var_43_arg_1=0, var_44=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_45_arg_0 = state_23; [L376] SORT_21 var_45_arg_1 = var_44; [L377] SORT_3 var_45 = var_45_arg_0 == var_45_arg_1; [L378] SORT_3 var_46_arg_0 = var_43; [L379] SORT_3 var_46_arg_1 = var_45; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46_arg_0=1, var_46_arg_1=0] [L380] EXPR var_46_arg_0 | var_46_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L380] SORT_3 var_46 = var_46_arg_0 | var_46_arg_1; [L381] SORT_21 var_47_arg_0 = state_23; [L382] SORT_21 var_47_arg_1 = var_22; [L383] SORT_3 var_47 = var_47_arg_0 == var_47_arg_1; [L384] SORT_21 var_48_arg_0 = state_23; [L385] SORT_21 var_48_arg_1 = var_26; [L386] SORT_3 var_48 = var_48_arg_0 == var_48_arg_1; [L387] SORT_3 var_49_arg_0 = var_47; [L388] SORT_3 var_49_arg_1 = var_48; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49_arg_0=1, var_49_arg_1=0] [L389] EXPR var_49_arg_0 | var_49_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L389] SORT_3 var_49 = var_49_arg_0 | var_49_arg_1; [L390] SORT_21 var_50_arg_0 = state_23; [L391] SORT_21 var_50_arg_1 = var_29; [L392] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L393] SORT_21 var_53_arg_0 = state_51; [L394] SORT_21 var_53_arg_1 = var_32; [L395] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L396] SORT_21 var_54_arg_0 = state_51; [L397] SORT_21 var_54_arg_1 = var_22; [L398] SORT_3 var_54 = var_54_arg_0 == var_54_arg_1; [L399] SORT_3 var_55_arg_0 = var_53; [L400] SORT_3 var_55_arg_1 = var_54; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0, var_55_arg_0=0, var_55_arg_1=1] [L401] EXPR var_55_arg_0 | var_55_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0] [L401] SORT_3 var_55 = var_55_arg_0 | var_55_arg_1; [L402] SORT_21 var_56_arg_0 = state_51; [L403] SORT_21 var_56_arg_1 = var_44; [L404] SORT_3 var_56 = var_56_arg_0 == var_56_arg_1; [L405] SORT_3 var_57_arg_0 = var_55; [L406] SORT_3 var_57_arg_1 = var_56; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0, var_57_arg_0=1, var_57_arg_1=0] [L407] EXPR var_57_arg_0 | var_57_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0] [L407] SORT_3 var_57 = var_57_arg_0 | var_57_arg_1; [L408] SORT_21 var_58_arg_0 = state_51; [L409] SORT_21 var_58_arg_1 = var_29; [L410] SORT_3 var_58 = var_58_arg_0 == var_58_arg_1; [L411] SORT_3 var_59_arg_0 = var_57; [L412] SORT_3 var_59_arg_1 = var_58; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0, var_59_arg_0=1, var_59_arg_1=0] [L413] EXPR var_59_arg_0 | var_59_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0] [L413] SORT_3 var_59 = var_59_arg_0 | var_59_arg_1; [L414] SORT_3 var_60_arg_0 = var_50; [L415] SORT_3 var_60_arg_1 = var_59; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_60_arg_0=0, var_60_arg_1=1] [L416] EXPR var_60_arg_0 & var_60_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1] [L416] SORT_3 var_60 = var_60_arg_0 & var_60_arg_1; [L417] SORT_3 var_61_arg_0 = var_49; [L418] SORT_3 var_61_arg_1 = var_60; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_61_arg_0=1, var_61_arg_1=0] [L419] EXPR var_61_arg_0 | var_61_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L419] SORT_3 var_61 = var_61_arg_0 | var_61_arg_1; [L420] SORT_21 var_62_arg_0 = state_23; [L421] SORT_21 var_62_arg_1 = var_32; [L422] SORT_3 var_62 = var_62_arg_0 == var_62_arg_1; [L423] SORT_3 var_63_arg_0 = var_61; [L424] SORT_3 var_63_arg_1 = var_62; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_63_arg_0=1, var_63_arg_1=0] [L425] EXPR var_63_arg_0 | var_63_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L425] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L426] SORT_21 var_64_arg_0 = state_23; [L427] SORT_21 var_64_arg_1 = var_35; [L428] SORT_3 var_64 = var_64_arg_0 == var_64_arg_1; [L429] SORT_3 var_65_arg_0 = var_63; [L430] SORT_3 var_65_arg_1 = var_64; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_65_arg_0=1, var_65_arg_1=0] [L431] EXPR var_65_arg_0 | var_65_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L431] SORT_3 var_65 = var_65_arg_0 | var_65_arg_1; [L432] SORT_21 var_66_arg_0 = state_23; [L433] SORT_21 var_66_arg_1 = var_38; [L434] SORT_3 var_66 = var_66_arg_0 == var_66_arg_1; [L435] SORT_3 var_67_arg_0 = var_65; [L436] SORT_3 var_67_arg_1 = var_66; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_67_arg_0=1, var_67_arg_1=0] [L437] EXPR var_67_arg_0 | var_67_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L437] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L438] SORT_21 var_68_arg_0 = state_23; [L439] SORT_21 var_68_arg_1 = var_41; [L440] SORT_3 var_68 = var_68_arg_0 == var_68_arg_1; [L441] SORT_3 var_69_arg_0 = var_67; [L442] SORT_3 var_69_arg_1 = var_68; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_69_arg_0=1, var_69_arg_1=0] [L443] EXPR var_69_arg_0 | var_69_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L443] SORT_3 var_69 = var_69_arg_0 | var_69_arg_1; [L444] SORT_21 var_70_arg_0 = state_23; [L445] SORT_21 var_70_arg_1 = var_44; [L446] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L447] SORT_3 var_71_arg_0 = var_69; [L448] SORT_3 var_71_arg_1 = var_70; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_71_arg_0=1, var_71_arg_1=0] [L449] EXPR var_71_arg_0 | var_71_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L449] SORT_3 var_71 = var_71_arg_0 | var_71_arg_1; [L450] SORT_3 var_72_arg_0 = var_46; [L451] SORT_3 var_72_arg_1 = var_71; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72_arg_0=1, var_72_arg_1=1] [L452] EXPR var_72_arg_0 & var_72_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L452] SORT_3 var_72 = var_72_arg_0 & var_72_arg_1; [L453] SORT_21 var_73_arg_0 = state_23; [L454] SORT_21 var_73_arg_1 = var_29; [L455] SORT_3 var_73 = var_73_arg_0 == var_73_arg_1; [L456] SORT_21 var_74_arg_0 = state_51; [L457] SORT_21 var_74_arg_1 = var_32; [L458] SORT_3 var_74 = var_74_arg_0 == var_74_arg_1; [L459] SORT_21 var_75_arg_0 = state_51; [L460] SORT_21 var_75_arg_1 = var_22; [L461] SORT_3 var_75 = var_75_arg_0 == var_75_arg_1; [L462] SORT_3 var_76_arg_0 = var_74; [L463] SORT_3 var_76_arg_1 = var_75; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0, var_76_arg_0=0, var_76_arg_1=1] [L464] EXPR var_76_arg_0 | var_76_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0] [L464] SORT_3 var_76 = var_76_arg_0 | var_76_arg_1; [L465] SORT_21 var_77_arg_0 = state_51; [L466] SORT_21 var_77_arg_1 = var_44; [L467] SORT_3 var_77 = var_77_arg_0 == var_77_arg_1; [L468] SORT_3 var_78_arg_0 = var_76; [L469] SORT_3 var_78_arg_1 = var_77; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0, var_78_arg_0=1, var_78_arg_1=0] [L470] EXPR var_78_arg_0 | var_78_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0] [L470] SORT_3 var_78 = var_78_arg_0 | var_78_arg_1; [L471] SORT_21 var_79_arg_0 = state_51; [L472] SORT_21 var_79_arg_1 = var_29; [L473] SORT_3 var_79 = var_79_arg_0 == var_79_arg_1; [L474] SORT_3 var_80_arg_0 = var_78; [L475] SORT_3 var_80_arg_1 = var_79; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0, var_80_arg_0=1, var_80_arg_1=0] [L476] EXPR var_80_arg_0 | var_80_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0] [L476] SORT_3 var_80 = var_80_arg_0 | var_80_arg_1; [L477] SORT_3 var_81_arg_0 = var_73; [L478] SORT_3 var_81_arg_1 = var_80; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_81_arg_0=0, var_81_arg_1=1] [L479] EXPR var_81_arg_0 & var_81_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1] [L479] SORT_3 var_81 = var_81_arg_0 & var_81_arg_1; [L480] SORT_21 var_82_arg_0 = state_23; [L481] SORT_21 var_82_arg_1 = var_29; [L482] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L483] SORT_3 var_83_arg_0 = var_82; [L484] SORT_3 var_83 = ~var_83_arg_0; [L485] SORT_3 var_84_arg_0 = var_81; [L486] SORT_3 var_84_arg_1 = var_83; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_84_arg_0=0, var_84_arg_1=-1] [L487] EXPR var_84_arg_0 | var_84_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1] [L487] SORT_3 var_84 = var_84_arg_0 | var_84_arg_1; [L488] SORT_3 var_85_arg_0 = var_72; [L489] SORT_3 var_85_arg_1 = var_84; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85_arg_0=1, var_85_arg_1=255] [L490] EXPR var_85_arg_0 & var_85_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L490] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L491] SORT_21 var_86_arg_0 = state_23; [L492] SORT_21 var_86_arg_1 = var_22; [L493] SORT_3 var_86 = var_86_arg_0 == var_86_arg_1; [L494] SORT_21 var_87_arg_0 = state_51; [L495] SORT_21 var_87_arg_1 = var_44; [L496] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L497] SORT_21 var_88_arg_0 = state_51; [L498] SORT_21 var_88_arg_1 = var_22; [L499] SORT_3 var_88 = var_88_arg_0 == var_88_arg_1; [L500] SORT_3 var_89_arg_0 = var_87; [L501] SORT_3 var_89_arg_1 = var_88; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1, var_89_arg_0=0, var_89_arg_1=1] [L502] EXPR var_89_arg_0 | var_89_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1] [L502] SORT_3 var_89 = var_89_arg_0 | var_89_arg_1; [L503] SORT_21 var_90_arg_0 = state_51; [L504] SORT_21 var_90_arg_1 = var_26; [L505] SORT_3 var_90 = var_90_arg_0 == var_90_arg_1; [L506] SORT_3 var_91_arg_0 = var_89; [L507] SORT_3 var_91_arg_1 = var_90; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1, var_91_arg_0=1, var_91_arg_1=0] [L508] EXPR var_91_arg_0 | var_91_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1] [L508] SORT_3 var_91 = var_91_arg_0 | var_91_arg_1; [L509] SORT_21 var_92_arg_0 = state_51; [L510] SORT_21 var_92_arg_1 = var_29; [L511] SORT_3 var_92 = var_92_arg_0 == var_92_arg_1; [L512] SORT_3 var_93_arg_0 = var_91; [L513] SORT_3 var_93_arg_1 = var_92; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1, var_93_arg_0=1, var_93_arg_1=0] [L514] EXPR var_93_arg_0 | var_93_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1] [L514] SORT_3 var_93 = var_93_arg_0 | var_93_arg_1; [L515] SORT_21 var_94_arg_0 = state_51; [L516] SORT_21 var_94_arg_1 = var_41; [L517] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L518] SORT_3 var_95_arg_0 = var_93; [L519] SORT_3 var_95_arg_1 = var_94; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1, var_95_arg_0=1, var_95_arg_1=0] [L520] EXPR var_95_arg_0 | var_95_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1] [L520] SORT_3 var_95 = var_95_arg_0 | var_95_arg_1; [L521] SORT_3 var_96_arg_0 = var_86; [L522] SORT_3 var_96_arg_1 = var_95; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_96_arg_0=1, var_96_arg_1=1] [L523] EXPR var_96_arg_0 & var_96_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0] [L523] SORT_3 var_96 = var_96_arg_0 & var_96_arg_1; [L524] SORT_21 var_97_arg_0 = state_23; [L525] SORT_21 var_97_arg_1 = var_22; [L526] SORT_3 var_97 = var_97_arg_0 == var_97_arg_1; [L527] SORT_3 var_98_arg_0 = var_97; [L528] SORT_3 var_98 = ~var_98_arg_0; [L529] SORT_3 var_99_arg_0 = var_96; [L530] SORT_3 var_99_arg_1 = var_98; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_99_arg_0=1, var_99_arg_1=-2] [L531] EXPR var_99_arg_0 | var_99_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0] [L531] SORT_3 var_99 = var_99_arg_0 | var_99_arg_1; [L532] SORT_3 var_100_arg_0 = var_85; [L533] SORT_3 var_100_arg_1 = var_99; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_100_arg_0=0, var_100_arg_1=254, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L534] EXPR var_100_arg_0 & var_100_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L534] SORT_3 var_100 = var_100_arg_0 & var_100_arg_1; [L535] SORT_3 var_102_arg_0 = var_100; [L536] SORT_3 var_102 = ~var_102_arg_0; [L537] SORT_3 var_103_arg_0 = var_101; [L538] SORT_3 var_103_arg_1 = var_102; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_103_arg_0=1, var_103_arg_1=-1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L539] EXPR var_103_arg_0 & var_103_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L539] SORT_3 var_103 = var_103_arg_0 & var_103_arg_1; [L540] EXPR var_103 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L540] var_103 = var_103 & mask_SORT_3 [L541] SORT_3 bad_104_arg_0 = var_103; [L542] CALL __VERIFIER_assert(!(bad_104_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1214 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.0s, OverallIterations: 48, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 41.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95619 SdHoareTripleChecker+Valid, 38.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95619 mSDsluCounter, 380991 SdHoareTripleChecker+Invalid, 32.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 311236 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87471 IncrementalHoareTripleChecker+Invalid, 87494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 69755 mSDtfsCounter, 87471 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 551 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1596occurred in iteration=47, InterpolantAutomatonStates: 366, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 47 MinimizatonAttempts, 10758 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 7157 NumberOfCodeBlocks, 7157 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 6947 ConstructedInterpolants, 0 QuantifiedInterpolants, 31400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 19:49:11,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...