./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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.vis_arrays_vsaR_p09.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 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:15:28,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:15:28,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:15:28,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:15:28,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:15:28,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:15:28,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:15:28,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:15:28,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:15:28,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:15:28,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:15:28,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:15:28,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:15:28,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:15:28,907 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:15:28,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:15:28,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:15:28,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:15:28,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:15:28,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:15:28,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:15:28,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:15:28,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:15:28,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:15:28,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:15:28,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:15:28,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:15:28,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:15:28,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:15:28,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:28,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:15:28,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:15:28,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:15:28,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:15:28,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:15:28,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:15:28,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:15:28,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:15:28,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:15:28,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:15:28,909 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 -> 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 [2025-02-08 00:15:29,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:15:29,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:15:29,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:15:29,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:15:29,153 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:15:29,153 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.vis_arrays_vsaR_p09.c [2025-02-08 00:15:30,249 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ce92d594/53eb4b39ddb74cc880f303239ee6f688/FLAGa900e70a0 [2025-02-08 00:15:30,597 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:15:30,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-02-08 00:15:30,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ce92d594/53eb4b39ddb74cc880f303239ee6f688/FLAGa900e70a0 [2025-02-08 00:15:30,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ce92d594/53eb4b39ddb74cc880f303239ee6f688 [2025-02-08 00:15:30,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:15:30,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:15:30,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:30,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:15:30,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:15:30,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:30" (1/1) ... [2025-02-08 00:15:30,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51401cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:30, skipping insertion in model container [2025-02-08 00:15:30,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:30" (1/1) ... [2025-02-08 00:15:30,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:15:30,815 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.vis_arrays_vsaR_p09.c[1259,1272] [2025-02-08 00:15:31,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:31,015 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:15:31,022 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.vis_arrays_vsaR_p09.c[1259,1272] [2025-02-08 00:15:31,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:31,135 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:15:31,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31 WrapperNode [2025-02-08 00:15:31,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:31,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:31,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:15:31,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:15:31,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,356 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2751 [2025-02-08 00:15:31,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:31,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:15:31,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:15:31,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:15:31,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,506 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-08 00:15:31,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:31,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:31,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:31,656 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:31,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (1/1) ... [2025-02-08 00:15:31,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:31,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:31,680 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-08 00:15:31,687 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-08 00:15:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:15:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:31,907 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:31,908 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:34,033 INFO L? ?]: Removed 1736 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:34,034 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:34,131 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:34,135 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:34,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:34 BoogieIcfgContainer [2025-02-08 00:15:34,135 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:34,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:34,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:34,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:34,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:15:30" (1/3) ... [2025-02-08 00:15:34,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447c8903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:34, skipping insertion in model container [2025-02-08 00:15:34,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:31" (2/3) ... [2025-02-08 00:15:34,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447c8903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:34, skipping insertion in model container [2025-02-08 00:15:34,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:34" (3/3) ... [2025-02-08 00:15:34,142 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-02-08 00:15:34,151 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:34,152 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p09.c that has 1 procedures, 721 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:34,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:34,211 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;@7b3b4d48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:34,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 721 states, 719 states have (on average 1.5006954102920724) internal successors, (1079), 720 states have internal predecessors, (1079), 0 states have call successors, (0), 0 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-08 00:15:34,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-08 00:15:34,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:34,233 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-08 00:15:34,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:34,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash 306124314, now seen corresponding path program 1 times [2025-02-08 00:15:34,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:34,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506199069] [2025-02-08 00:15:34,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:34,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:34,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-08 00:15:34,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 00:15:34,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:34,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:35,286 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-08 00:15:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506199069] [2025-02-08 00:15:35,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506199069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:35,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:35,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:35,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271890507] [2025-02-08 00:15:35,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:35,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:35,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:35,306 INFO L87 Difference]: Start difference. First operand has 721 states, 719 states have (on average 1.5006954102920724) internal successors, (1079), 720 states have internal predecessors, (1079), 0 states have call successors, (0), 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 35.0) internal successors, (140), 4 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-08 00:15:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:35,786 INFO L93 Difference]: Finished difference Result 1389 states and 2081 transitions. [2025-02-08 00:15:35,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:35,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 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-08 00:15:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:35,800 INFO L225 Difference]: With dead ends: 1389 [2025-02-08 00:15:35,800 INFO L226 Difference]: Without dead ends: 721 [2025-02-08 00:15:35,803 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-08 00:15:35,807 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 0 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:35,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2683 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-02-08 00:15:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2025-02-08 00:15:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 1.4972222222222222) internal successors, (1078), 720 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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-08 00:15:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1078 transitions. [2025-02-08 00:15:35,875 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1078 transitions. Word has length 140 [2025-02-08 00:15:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:35,876 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1078 transitions. [2025-02-08 00:15:35,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 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-08 00:15:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1078 transitions. [2025-02-08 00:15:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-08 00:15:35,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:35,878 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-08 00:15:35,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:15:35,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:35,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash 904599057, now seen corresponding path program 1 times [2025-02-08 00:15:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:35,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313246945] [2025-02-08 00:15:35,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:35,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:35,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-08 00:15:35,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-08 00:15:35,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:35,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:36,267 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-08 00:15:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313246945] [2025-02-08 00:15:36,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313246945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:36,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:36,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332637979] [2025-02-08 00:15:36,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:36,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:36,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:36,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:36,270 INFO L87 Difference]: Start difference. First operand 721 states and 1078 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 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-08 00:15:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:36,600 INFO L93 Difference]: Finished difference Result 1391 states and 2080 transitions. [2025-02-08 00:15:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:36,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 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-08 00:15:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:36,605 INFO L225 Difference]: With dead ends: 1391 [2025-02-08 00:15:36,605 INFO L226 Difference]: Without dead ends: 723 [2025-02-08 00:15:36,606 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-08 00:15:36,609 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 0 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:36,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2680 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-02-08 00:15:36,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2025-02-08 00:15:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.4958448753462603) internal successors, (1080), 722 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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-08 00:15:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1080 transitions. [2025-02-08 00:15:36,634 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1080 transitions. Word has length 141 [2025-02-08 00:15:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:36,634 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1080 transitions. [2025-02-08 00:15:36,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 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-08 00:15:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1080 transitions. [2025-02-08 00:15:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-08 00:15:36,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:36,636 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-08 00:15:36,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:15:36,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:36,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash -90690315, now seen corresponding path program 1 times [2025-02-08 00:15:36,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:36,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180831251] [2025-02-08 00:15:36,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:36,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-08 00:15:36,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-08 00:15:36,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:36,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:37,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:37,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180831251] [2025-02-08 00:15:37,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180831251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:37,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:37,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:37,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767885800] [2025-02-08 00:15:37,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:37,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:37,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:37,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:37,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:37,352 INFO L87 Difference]: Start difference. First operand 723 states and 1080 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-08 00:15:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:37,776 INFO L93 Difference]: Finished difference Result 1401 states and 2093 transitions. [2025-02-08 00:15:37,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:37,776 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-08 00:15:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:37,780 INFO L225 Difference]: With dead ends: 1401 [2025-02-08 00:15:37,780 INFO L226 Difference]: Without dead ends: 731 [2025-02-08 00:15:37,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:37,782 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 6 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:37,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3564 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-02-08 00:15:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2025-02-08 00:15:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.4945054945054945) internal successors, (1088), 728 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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-08 00:15:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1088 transitions. [2025-02-08 00:15:37,806 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1088 transitions. Word has length 142 [2025-02-08 00:15:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:37,806 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1088 transitions. [2025-02-08 00:15:37,806 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-08 00:15:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1088 transitions. [2025-02-08 00:15:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-08 00:15:37,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:37,808 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-08 00:15:37,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:15:37,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:37,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1903077896, now seen corresponding path program 1 times [2025-02-08 00:15:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933408699] [2025-02-08 00:15:37,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:37,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:37,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 00:15:37,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 00:15:37,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:37,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:38,458 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-08 00:15:38,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933408699] [2025-02-08 00:15:38,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933408699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:38,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:38,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999947763] [2025-02-08 00:15:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:38,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:38,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:38,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:38,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:38,459 INFO L87 Difference]: Start difference. First operand 729 states and 1088 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-08 00:15:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:38,854 INFO L93 Difference]: Finished difference Result 1413 states and 2109 transitions. [2025-02-08 00:15:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:38,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-08 00:15:38,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:38,858 INFO L225 Difference]: With dead ends: 1413 [2025-02-08 00:15:38,859 INFO L226 Difference]: Without dead ends: 737 [2025-02-08 00:15:38,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:38,862 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 6 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:38,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3564 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-02-08 00:15:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 735. [2025-02-08 00:15:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 734 states have (on average 1.4931880108991826) internal successors, (1096), 734 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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-08 00:15:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1096 transitions. [2025-02-08 00:15:38,873 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1096 transitions. Word has length 143 [2025-02-08 00:15:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:38,873 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1096 transitions. [2025-02-08 00:15:38,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-08 00:15:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1096 transitions. [2025-02-08 00:15:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-08 00:15:38,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:38,875 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-08 00:15:38,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:15:38,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:38,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash 17312419, now seen corresponding path program 1 times [2025-02-08 00:15:38,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:38,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390583307] [2025-02-08 00:15:38,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:38,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-08 00:15:38,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 00:15:38,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:38,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:39,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:39,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390583307] [2025-02-08 00:15:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390583307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:39,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767806654] [2025-02-08 00:15:39,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:39,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:39,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:39,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:39,417 INFO L87 Difference]: Start difference. First operand 735 states and 1096 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 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-08 00:15:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:39,890 INFO L93 Difference]: Finished difference Result 1423 states and 2122 transitions. [2025-02-08 00:15:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:39,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 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-08 00:15:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:39,893 INFO L225 Difference]: With dead ends: 1423 [2025-02-08 00:15:39,893 INFO L226 Difference]: Without dead ends: 741 [2025-02-08 00:15:39,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:39,894 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1043 mSDsluCounter, 2609 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 3482 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:39,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 3482 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-02-08 00:15:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2025-02-08 00:15:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.491891891891892) internal successors, (1104), 740 states have internal predecessors, (1104), 0 states have call successors, (0), 0 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-08 00:15:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1104 transitions. [2025-02-08 00:15:39,905 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1104 transitions. Word has length 144 [2025-02-08 00:15:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:39,905 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1104 transitions. [2025-02-08 00:15:39,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 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-08 00:15:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1104 transitions. [2025-02-08 00:15:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-08 00:15:39,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:39,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] [2025-02-08 00:15:39,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:15:39,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:39,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1355426285, now seen corresponding path program 1 times [2025-02-08 00:15:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:39,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656512078] [2025-02-08 00:15:39,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:39,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:39,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-08 00:15:40,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 00:15:40,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:40,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:40,735 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-08 00:15:40,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:40,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656512078] [2025-02-08 00:15:40,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656512078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:40,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:40,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:40,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14351688] [2025-02-08 00:15:40,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:40,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:40,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:40,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:40,739 INFO L87 Difference]: Start difference. First operand 741 states and 1104 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 6 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-08 00:15:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:41,256 INFO L93 Difference]: Finished difference Result 1437 states and 2141 transitions. [2025-02-08 00:15:41,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:15:41,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 6 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-08 00:15:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:41,259 INFO L225 Difference]: With dead ends: 1437 [2025-02-08 00:15:41,259 INFO L226 Difference]: Without dead ends: 749 [2025-02-08 00:15:41,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:41,260 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 1000 mSDsluCounter, 3471 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 4342 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:41,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 4342 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-02-08 00:15:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 746. [2025-02-08 00:15:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.4899328859060403) internal successors, (1110), 745 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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-08 00:15:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1110 transitions. [2025-02-08 00:15:41,275 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1110 transitions. Word has length 144 [2025-02-08 00:15:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:41,275 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1110 transitions. [2025-02-08 00:15:41,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 6 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-08 00:15:41,275 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1110 transitions. [2025-02-08 00:15:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-08 00:15:41,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:41,276 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-08 00:15:41,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:15:41,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:41,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash 863952657, now seen corresponding path program 1 times [2025-02-08 00:15:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:41,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750249295] [2025-02-08 00:15:41,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:41,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 00:15:41,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 00:15:41,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:41,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:41,815 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-08 00:15:41,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:41,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750249295] [2025-02-08 00:15:41,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750249295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:41,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:41,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259858313] [2025-02-08 00:15:41,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:41,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:41,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:41,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:41,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:41,817 INFO L87 Difference]: Start difference. First operand 746 states and 1110 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 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-08 00:15:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:42,204 INFO L93 Difference]: Finished difference Result 1447 states and 2153 transitions. [2025-02-08 00:15:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:42,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 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-08 00:15:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:42,208 INFO L225 Difference]: With dead ends: 1447 [2025-02-08 00:15:42,208 INFO L226 Difference]: Without dead ends: 754 [2025-02-08 00:15:42,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:42,210 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 6 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:42,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3564 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-02-08 00:15:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2025-02-08 00:15:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 1.4886817576564582) internal successors, (1118), 751 states have internal predecessors, (1118), 0 states have call successors, (0), 0 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-08 00:15:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1118 transitions. [2025-02-08 00:15:42,223 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1118 transitions. Word has length 145 [2025-02-08 00:15:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:42,223 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1118 transitions. [2025-02-08 00:15:42,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 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-08 00:15:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1118 transitions. [2025-02-08 00:15:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-08 00:15:42,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:42,227 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-08 00:15:42,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:15:42,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:42,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1403662867, now seen corresponding path program 1 times [2025-02-08 00:15:42,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:42,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368237513] [2025-02-08 00:15:42,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:42,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:42,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 00:15:42,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 00:15:42,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:42,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:42,744 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-08 00:15:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:42,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368237513] [2025-02-08 00:15:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368237513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:42,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116215297] [2025-02-08 00:15:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:42,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:42,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:42,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:42,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:42,746 INFO L87 Difference]: Start difference. First operand 752 states and 1118 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 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-08 00:15:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:43,131 INFO L93 Difference]: Finished difference Result 1660 states and 2465 transitions. [2025-02-08 00:15:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:43,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 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-08 00:15:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:43,134 INFO L225 Difference]: With dead ends: 1660 [2025-02-08 00:15:43,134 INFO L226 Difference]: Without dead ends: 961 [2025-02-08 00:15:43,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:43,136 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 173 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 3784 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:43,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 3784 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-02-08 00:15:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 958. [2025-02-08 00:15:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.48380355276907) internal successors, (1420), 957 states have internal predecessors, (1420), 0 states have call successors, (0), 0 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-08 00:15:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1420 transitions. [2025-02-08 00:15:43,151 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1420 transitions. Word has length 146 [2025-02-08 00:15:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:43,152 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1420 transitions. [2025-02-08 00:15:43,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 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-08 00:15:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1420 transitions. [2025-02-08 00:15:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-08 00:15:43,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:43,153 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-08 00:15:43,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:15:43,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:43,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1842728104, now seen corresponding path program 1 times [2025-02-08 00:15:43,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:43,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574199083] [2025-02-08 00:15:43,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:43,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 00:15:43,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 00:15:43,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:43,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:43,593 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-08 00:15:43,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:43,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574199083] [2025-02-08 00:15:43,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574199083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:43,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:43,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975406513] [2025-02-08 00:15:43,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:43,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:43,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:43,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:43,595 INFO L87 Difference]: Start difference. First operand 958 states and 1420 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-08 00:15:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:43,964 INFO L93 Difference]: Finished difference Result 1879 states and 2785 transitions. [2025-02-08 00:15:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:43,964 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-08 00:15:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:43,967 INFO L225 Difference]: With dead ends: 1879 [2025-02-08 00:15:43,967 INFO L226 Difference]: Without dead ends: 974 [2025-02-08 00:15:43,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:43,969 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 6 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:43,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3564 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:43,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-02-08 00:15:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 970. [2025-02-08 00:15:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.4819401444788443) internal successors, (1436), 969 states have internal predecessors, (1436), 0 states have call successors, (0), 0 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-08 00:15:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1436 transitions. [2025-02-08 00:15:43,985 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1436 transitions. Word has length 147 [2025-02-08 00:15:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:43,985 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1436 transitions. [2025-02-08 00:15:43,985 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-08 00:15:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1436 transitions. [2025-02-08 00:15:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-08 00:15:43,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:43,987 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-08 00:15:43,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:15:43,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:43,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:43,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2122561895, now seen corresponding path program 1 times [2025-02-08 00:15:43,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:43,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412521752] [2025-02-08 00:15:43,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:43,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:44,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 00:15:44,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 00:15:44,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:44,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:44,587 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-08 00:15:44,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:44,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412521752] [2025-02-08 00:15:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412521752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:44,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:44,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:15:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278873575] [2025-02-08 00:15:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:44,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:44,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:44,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:44,589 INFO L87 Difference]: Start difference. First operand 970 states and 1436 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-08 00:15:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:45,230 INFO L93 Difference]: Finished difference Result 1895 states and 2805 transitions. [2025-02-08 00:15:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:15:45,231 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-08 00:15:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:45,234 INFO L225 Difference]: With dead ends: 1895 [2025-02-08 00:15:45,234 INFO L226 Difference]: Without dead ends: 978 [2025-02-08 00:15:45,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:45,235 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 172 mSDsluCounter, 4442 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 5333 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:45,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 5333 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:15:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-02-08 00:15:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 977. [2025-02-08 00:15:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.4815573770491803) internal successors, (1446), 976 states have internal predecessors, (1446), 0 states have call successors, (0), 0 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-08 00:15:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1446 transitions. [2025-02-08 00:15:45,251 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1446 transitions. Word has length 148 [2025-02-08 00:15:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:45,251 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1446 transitions. [2025-02-08 00:15:45,251 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-08 00:15:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1446 transitions. [2025-02-08 00:15:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-08 00:15:45,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:45,253 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-08 00:15:45,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:15:45,254 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:45,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1279316194, now seen corresponding path program 1 times [2025-02-08 00:15:45,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:45,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661299009] [2025-02-08 00:15:45,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:45,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:45,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 00:15:45,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 00:15:45,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:45,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:45,466 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-08 00:15:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661299009] [2025-02-08 00:15:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661299009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:45,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455788757] [2025-02-08 00:15:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:45,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:45,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:45,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:45,468 INFO L87 Difference]: Start difference. First operand 977 states and 1446 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 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-08 00:15:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:45,809 INFO L93 Difference]: Finished difference Result 1919 states and 2840 transitions. [2025-02-08 00:15:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 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-08 00:15:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:45,812 INFO L225 Difference]: With dead ends: 1919 [2025-02-08 00:15:45,813 INFO L226 Difference]: Without dead ends: 995 [2025-02-08 00:15:45,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:45,815 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 16 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:45,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3570 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-02-08 00:15:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2025-02-08 00:15:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.4808853118712273) internal successors, (1472), 994 states have internal predecessors, (1472), 0 states have call successors, (0), 0 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-08 00:15:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1472 transitions. [2025-02-08 00:15:45,828 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1472 transitions. Word has length 148 [2025-02-08 00:15:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:45,829 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1472 transitions. [2025-02-08 00:15:45,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 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-08 00:15:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1472 transitions. [2025-02-08 00:15:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-08 00:15:45,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:45,830 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-08 00:15:45,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:15:45,831 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:45,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash 894510557, now seen corresponding path program 1 times [2025-02-08 00:15:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:45,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601810961] [2025-02-08 00:15:45,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:45,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 00:15:45,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 00:15:45,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:45,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:46,256 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-08 00:15:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:46,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601810961] [2025-02-08 00:15:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601810961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:46,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:46,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287448145] [2025-02-08 00:15:46,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:46,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:46,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:46,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:46,258 INFO L87 Difference]: Start difference. First operand 995 states and 1472 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 5 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-08 00:15:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:46,651 INFO L93 Difference]: Finished difference Result 1939 states and 2868 transitions. [2025-02-08 00:15:46,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:46,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 5 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-08 00:15:46,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:46,655 INFO L225 Difference]: With dead ends: 1939 [2025-02-08 00:15:46,655 INFO L226 Difference]: Without dead ends: 997 [2025-02-08 00:15:46,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:46,657 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1047 mSDsluCounter, 2663 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:46,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 3555 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-02-08 00:15:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2025-02-08 00:15:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 996 states have (on average 1.4799196787148594) internal successors, (1474), 996 states have internal predecessors, (1474), 0 states have call successors, (0), 0 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-08 00:15:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1474 transitions. [2025-02-08 00:15:46,669 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1474 transitions. Word has length 149 [2025-02-08 00:15:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:46,669 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1474 transitions. [2025-02-08 00:15:46,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 5 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-08 00:15:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1474 transitions. [2025-02-08 00:15:46,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-08 00:15:46,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:46,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, 1, 1, 1, 1] [2025-02-08 00:15:46,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:15:46,671 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:46,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash -76075459, now seen corresponding path program 1 times [2025-02-08 00:15:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:46,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43474998] [2025-02-08 00:15:46,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:46,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 00:15:46,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 00:15:46,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:46,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:47,065 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-08 00:15:47,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:47,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43474998] [2025-02-08 00:15:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43474998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:47,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146032884] [2025-02-08 00:15:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:47,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:47,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:47,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:47,066 INFO L87 Difference]: Start difference. First operand 997 states and 1474 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 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-08 00:15:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:47,557 INFO L93 Difference]: Finished difference Result 2353 states and 3472 transitions. [2025-02-08 00:15:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:47,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 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-08 00:15:47,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:47,561 INFO L225 Difference]: With dead ends: 2353 [2025-02-08 00:15:47,561 INFO L226 Difference]: Without dead ends: 1409 [2025-02-08 00:15:47,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:47,563 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 2133 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:47,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 3527 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-02-08 00:15:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1001. [2025-02-08 00:15:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 1000 states have (on average 1.48) internal successors, (1480), 1000 states have internal predecessors, (1480), 0 states have call successors, (0), 0 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-08 00:15:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1480 transitions. [2025-02-08 00:15:47,576 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1480 transitions. Word has length 150 [2025-02-08 00:15:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:47,576 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1480 transitions. [2025-02-08 00:15:47,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 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-08 00:15:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1480 transitions. [2025-02-08 00:15:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-08 00:15:47,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:47,578 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-08 00:15:47,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:15:47,578 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:47,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:47,578 INFO L85 PathProgramCache]: Analyzing trace with hash 88974049, now seen corresponding path program 1 times [2025-02-08 00:15:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:47,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455210008] [2025-02-08 00:15:47,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:47,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 00:15:47,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 00:15:47,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:47,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:47,769 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-08 00:15:47,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455210008] [2025-02-08 00:15:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455210008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:47,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:47,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:47,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486253353] [2025-02-08 00:15:47,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:47,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:47,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:47,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:47,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:47,771 INFO L87 Difference]: Start difference. First operand 1001 states and 1480 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 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-08 00:15:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:48,084 INFO L93 Difference]: Finished difference Result 1969 states and 2911 transitions. [2025-02-08 00:15:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:48,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 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-08 00:15:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:48,087 INFO L225 Difference]: With dead ends: 1969 [2025-02-08 00:15:48,087 INFO L226 Difference]: Without dead ends: 1021 [2025-02-08 00:15:48,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:48,089 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 8 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:48,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3570 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-02-08 00:15:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2025-02-08 00:15:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 1.4784313725490197) internal successors, (1508), 1020 states have internal predecessors, (1508), 0 states have call successors, (0), 0 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-08 00:15:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1508 transitions. [2025-02-08 00:15:48,101 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1508 transitions. Word has length 150 [2025-02-08 00:15:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:48,102 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1508 transitions. [2025-02-08 00:15:48,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 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-08 00:15:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1508 transitions. [2025-02-08 00:15:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-08 00:15:48,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:48,104 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-08 00:15:48,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:15:48,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:48,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1186779094, now seen corresponding path program 1 times [2025-02-08 00:15:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684807938] [2025-02-08 00:15:48,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:48,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 00:15:48,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 00:15:48,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:48,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:48,329 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-08 00:15:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684807938] [2025-02-08 00:15:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684807938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:48,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786521080] [2025-02-08 00:15:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:48,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:48,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:48,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:48,331 INFO L87 Difference]: Start difference. First operand 1021 states and 1508 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-08 00:15:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:48,631 INFO L93 Difference]: Finished difference Result 2045 states and 3019 transitions. [2025-02-08 00:15:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:48,631 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-08 00:15:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:48,634 INFO L225 Difference]: With dead ends: 2045 [2025-02-08 00:15:48,634 INFO L226 Difference]: Without dead ends: 1077 [2025-02-08 00:15:48,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:48,635 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 19 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:48,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3570 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-02-08 00:15:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2025-02-08 00:15:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.4758364312267658) internal successors, (1588), 1076 states have internal predecessors, (1588), 0 states have call successors, (0), 0 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-08 00:15:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1588 transitions. [2025-02-08 00:15:48,647 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1588 transitions. Word has length 151 [2025-02-08 00:15:48,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:48,647 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1588 transitions. [2025-02-08 00:15:48,647 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-08 00:15:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1588 transitions. [2025-02-08 00:15:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-08 00:15:48,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:48,649 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-08 00:15:48,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:15:48,649 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:48,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:48,649 INFO L85 PathProgramCache]: Analyzing trace with hash 795045378, now seen corresponding path program 1 times [2025-02-08 00:15:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032501719] [2025-02-08 00:15:48,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:48,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:48,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 00:15:48,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 00:15:48,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:48,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:49,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-08 00:15:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:49,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032501719] [2025-02-08 00:15:49,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032501719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:49,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:49,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324758233] [2025-02-08 00:15:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:49,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:49,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:49,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:49,066 INFO L87 Difference]: Start difference. First operand 1077 states and 1588 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) 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-08 00:15:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:49,718 INFO L93 Difference]: Finished difference Result 2551 states and 3754 transitions. [2025-02-08 00:15:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:49,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) 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-08 00:15:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:49,722 INFO L225 Difference]: With dead ends: 2551 [2025-02-08 00:15:49,722 INFO L226 Difference]: Without dead ends: 1527 [2025-02-08 00:15:49,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:15:49,724 INFO L435 NwaCegarLoop]: 1297 mSDtfsCounter, 1588 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 4734 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:49,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 4734 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:15:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-02-08 00:15:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1077. [2025-02-08 00:15:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.4758364312267658) internal successors, (1588), 1076 states have internal predecessors, (1588), 0 states have call successors, (0), 0 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-08 00:15:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1588 transitions. [2025-02-08 00:15:49,736 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1588 transitions. Word has length 151 [2025-02-08 00:15:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:49,736 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1588 transitions. [2025-02-08 00:15:49,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) 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-08 00:15:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1588 transitions. [2025-02-08 00:15:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 00:15:49,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:49,737 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-08 00:15:49,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:15:49,737 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:49,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:49,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1553322931, now seen corresponding path program 1 times [2025-02-08 00:15:49,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:49,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865001470] [2025-02-08 00:15:49,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:49,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:49,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 00:15:49,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 00:15:49,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:49,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:50,030 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-08 00:15:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865001470] [2025-02-08 00:15:50,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865001470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:50,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:50,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:50,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081334562] [2025-02-08 00:15:50,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:50,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:50,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:50,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:50,031 INFO L87 Difference]: Start difference. First operand 1077 states and 1588 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 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-08 00:15:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:50,425 INFO L93 Difference]: Finished difference Result 2121 states and 3127 transitions. [2025-02-08 00:15:50,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:50,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 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-08 00:15:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:50,428 INFO L225 Difference]: With dead ends: 2121 [2025-02-08 00:15:50,428 INFO L226 Difference]: Without dead ends: 1097 [2025-02-08 00:15:50,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:50,429 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 8 mSDsluCounter, 3565 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4460 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:50,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4460 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-02-08 00:15:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2025-02-08 00:15:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1096 states have (on average 1.4744525547445255) internal successors, (1616), 1096 states have internal predecessors, (1616), 0 states have call successors, (0), 0 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-08 00:15:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1616 transitions. [2025-02-08 00:15:50,447 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1616 transitions. Word has length 152 [2025-02-08 00:15:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:50,447 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1616 transitions. [2025-02-08 00:15:50,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 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-08 00:15:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1616 transitions. [2025-02-08 00:15:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 00:15:50,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:50,449 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-08 00:15:50,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 00:15:50,449 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:50,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1966655140, now seen corresponding path program 1 times [2025-02-08 00:15:50,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:50,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991915003] [2025-02-08 00:15:50,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:50,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:50,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 00:15:50,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 00:15:50,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:50,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:50,981 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-08 00:15:50,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:50,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991915003] [2025-02-08 00:15:50,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991915003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:50,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:50,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245493288] [2025-02-08 00:15:50,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:50,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:50,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:50,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:50,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:50,982 INFO L87 Difference]: Start difference. First operand 1097 states and 1616 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 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-08 00:15:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:51,429 INFO L93 Difference]: Finished difference Result 2148 states and 3164 transitions. [2025-02-08 00:15:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:15:51,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 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-08 00:15:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:51,432 INFO L225 Difference]: With dead ends: 2148 [2025-02-08 00:15:51,432 INFO L226 Difference]: Without dead ends: 1104 [2025-02-08 00:15:51,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:51,433 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 941 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 4332 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:51,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 4332 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2025-02-08 00:15:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1103. [2025-02-08 00:15:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1102 states have (on average 1.4727767695099818) internal successors, (1623), 1102 states have internal predecessors, (1623), 0 states have call successors, (0), 0 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-08 00:15:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1623 transitions. [2025-02-08 00:15:51,442 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1623 transitions. Word has length 152 [2025-02-08 00:15:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:51,443 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1623 transitions. [2025-02-08 00:15:51,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 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-08 00:15:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1623 transitions. [2025-02-08 00:15:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-08 00:15:51,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:51,444 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-08 00:15:51,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:15:51,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:51,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash -522961223, now seen corresponding path program 1 times [2025-02-08 00:15:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056769392] [2025-02-08 00:15:51,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:51,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 00:15:51,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 00:15:51,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:51,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:51,649 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-08 00:15:51,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:51,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056769392] [2025-02-08 00:15:51,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056769392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:51,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:51,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:51,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581587094] [2025-02-08 00:15:51,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:51,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:51,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:51,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:51,650 INFO L87 Difference]: Start difference. First operand 1103 states and 1623 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-08 00:15:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:51,937 INFO L93 Difference]: Finished difference Result 2209 states and 3249 transitions. [2025-02-08 00:15:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:51,938 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-08 00:15:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:51,940 INFO L225 Difference]: With dead ends: 2209 [2025-02-08 00:15:51,940 INFO L226 Difference]: Without dead ends: 1159 [2025-02-08 00:15:51,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:51,942 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 19 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:51,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3570 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-02-08 00:15:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2025-02-08 00:15:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.4706390328151986) internal successors, (1703), 1158 states have internal predecessors, (1703), 0 states have call successors, (0), 0 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-08 00:15:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1703 transitions. [2025-02-08 00:15:51,952 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1703 transitions. Word has length 153 [2025-02-08 00:15:51,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:51,952 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1703 transitions. [2025-02-08 00:15:51,952 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-08 00:15:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1703 transitions. [2025-02-08 00:15:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-08 00:15:51,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:51,953 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-08 00:15:51,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 00:15:51,953 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:51,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1324205108, now seen corresponding path program 1 times [2025-02-08 00:15:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:51,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637835345] [2025-02-08 00:15:51,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:51,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:51,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 00:15:52,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 00:15:52,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:52,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:52,685 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-08 00:15:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:52,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637835345] [2025-02-08 00:15:52,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637835345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:52,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 00:15:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310656525] [2025-02-08 00:15:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:52,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 00:15:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:52,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 00:15:52,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:15:52,687 INFO L87 Difference]: Start difference. First operand 1159 states and 1703 transitions. Second operand has 13 states, 13 states have (on average 11.76923076923077) internal successors, (153), 12 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-08 00:15:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:53,705 INFO L93 Difference]: Finished difference Result 2293 states and 3369 transitions. [2025-02-08 00:15:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 00:15:53,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.76923076923077) internal successors, (153), 12 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-08 00:15:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:53,708 INFO L225 Difference]: With dead ends: 2293 [2025-02-08 00:15:53,708 INFO L226 Difference]: Without dead ends: 1187 [2025-02-08 00:15:53,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:15:53,711 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 1628 mSDsluCounter, 7550 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 8445 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:53,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 8445 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:15:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-02-08 00:15:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1175. [2025-02-08 00:15:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1174 states have (on average 1.4701873935264054) internal successors, (1726), 1174 states have internal predecessors, (1726), 0 states have call successors, (0), 0 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-08 00:15:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1726 transitions. [2025-02-08 00:15:53,724 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1726 transitions. Word has length 153 [2025-02-08 00:15:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:53,725 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1726 transitions. [2025-02-08 00:15:53,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.76923076923077) internal successors, (153), 12 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-08 00:15:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1726 transitions. [2025-02-08 00:15:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 00:15:53,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:53,726 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-08 00:15:53,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 00:15:53,726 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:53,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:53,727 INFO L85 PathProgramCache]: Analyzing trace with hash -897515263, now seen corresponding path program 1 times [2025-02-08 00:15:53,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:53,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25320493] [2025-02-08 00:15:53,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:53,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:53,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 00:15:53,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 00:15:53,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:53,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:53,897 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-08 00:15:53,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:53,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25320493] [2025-02-08 00:15:53,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25320493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:53,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672707810] [2025-02-08 00:15:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:53,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:53,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:53,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:53,898 INFO L87 Difference]: Start difference. First operand 1175 states and 1726 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-08 00:15:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:54,169 INFO L93 Difference]: Finished difference Result 2317 states and 3403 transitions. [2025-02-08 00:15:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:54,169 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-08 00:15:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:54,171 INFO L225 Difference]: With dead ends: 2317 [2025-02-08 00:15:54,171 INFO L226 Difference]: Without dead ends: 1195 [2025-02-08 00:15:54,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:54,173 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 8 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:54,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3570 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2025-02-08 00:15:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2025-02-08 00:15:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1194 states have (on average 1.4690117252931323) internal successors, (1754), 1194 states have internal predecessors, (1754), 0 states have call successors, (0), 0 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-08 00:15:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1754 transitions. [2025-02-08 00:15:54,188 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1754 transitions. Word has length 154 [2025-02-08 00:15:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:54,188 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1754 transitions. [2025-02-08 00:15:54,188 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-08 00:15:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1754 transitions. [2025-02-08 00:15:54,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 00:15:54,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:54,193 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-08 00:15:54,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 00:15:54,194 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:54,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash -311190023, now seen corresponding path program 1 times [2025-02-08 00:15:54,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:54,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937101074] [2025-02-08 00:15:54,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:54,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 00:15:54,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 00:15:54,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:54,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:54,546 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-08 00:15:54,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937101074] [2025-02-08 00:15:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937101074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:54,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:54,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982959749] [2025-02-08 00:15:54,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:54,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:54,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:54,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:54,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:54,547 INFO L87 Difference]: Start difference. First operand 1195 states and 1754 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 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-08 00:15:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:54,947 INFO L93 Difference]: Finished difference Result 2779 states and 4070 transitions. [2025-02-08 00:15:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:54,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 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-08 00:15:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:54,955 INFO L225 Difference]: With dead ends: 2779 [2025-02-08 00:15:54,955 INFO L226 Difference]: Without dead ends: 1637 [2025-02-08 00:15:54,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:54,958 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 514 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:54,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 3466 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2025-02-08 00:15:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1197. [2025-02-08 00:15:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1196 states have (on average 1.4682274247491638) internal successors, (1756), 1196 states have internal predecessors, (1756), 0 states have call successors, (0), 0 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-08 00:15:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1756 transitions. [2025-02-08 00:15:54,973 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1756 transitions. Word has length 154 [2025-02-08 00:15:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:54,973 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 1756 transitions. [2025-02-08 00:15:54,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 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-08 00:15:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1756 transitions. [2025-02-08 00:15:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-08 00:15:54,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:54,975 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-08 00:15:54,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 00:15:54,975 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:54,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1166180586, now seen corresponding path program 1 times [2025-02-08 00:15:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:54,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985510155] [2025-02-08 00:15:54,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:54,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:55,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-08 00:15:55,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-08 00:15:55,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:55,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:55,177 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-08 00:15:55,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:55,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985510155] [2025-02-08 00:15:55,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985510155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:55,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:55,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:55,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765835348] [2025-02-08 00:15:55,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:55,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:55,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:55,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:55,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:55,179 INFO L87 Difference]: Start difference. First operand 1197 states and 1756 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-08 00:15:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:55,478 INFO L93 Difference]: Finished difference Result 2393 states and 3509 transitions. [2025-02-08 00:15:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:55,479 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-08 00:15:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:55,482 INFO L225 Difference]: With dead ends: 2393 [2025-02-08 00:15:55,482 INFO L226 Difference]: Without dead ends: 1251 [2025-02-08 00:15:55,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:55,484 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 19 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:55,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3570 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-02-08 00:15:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2025-02-08 00:15:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1250 states have (on average 1.4656) internal successors, (1832), 1250 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-08 00:15:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1832 transitions. [2025-02-08 00:15:55,493 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1832 transitions. Word has length 155 [2025-02-08 00:15:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:55,494 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1832 transitions. [2025-02-08 00:15:55,494 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-08 00:15:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1832 transitions. [2025-02-08 00:15:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-08 00:15:55,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:55,494 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-08 00:15:55,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 00:15:55,495 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:55,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1242513555, now seen corresponding path program 1 times [2025-02-08 00:15:55,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:55,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089404575] [2025-02-08 00:15:55,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:55,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:55,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-08 00:15:55,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-08 00:15:55,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:55,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:55,680 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-08 00:15:55,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:55,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089404575] [2025-02-08 00:15:55,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089404575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:55,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:55,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:55,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906778673] [2025-02-08 00:15:55,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:55,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:55,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:55,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:55,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:55,682 INFO L87 Difference]: Start difference. First operand 1251 states and 1832 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 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-08 00:15:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:55,972 INFO L93 Difference]: Finished difference Result 2467 states and 3613 transitions. [2025-02-08 00:15:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:55,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 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-08 00:15:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:55,979 INFO L225 Difference]: With dead ends: 2467 [2025-02-08 00:15:55,979 INFO L226 Difference]: Without dead ends: 1271 [2025-02-08 00:15:55,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:55,983 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 8 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:55,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3570 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-02-08 00:15:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2025-02-08 00:15:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 1.4645669291338583) internal successors, (1860), 1270 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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-08 00:15:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1860 transitions. [2025-02-08 00:15:56,007 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1860 transitions. Word has length 156 [2025-02-08 00:15:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:56,007 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1860 transitions. [2025-02-08 00:15:56,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 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-08 00:15:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1860 transitions. [2025-02-08 00:15:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-08 00:15:56,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:56,008 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-08 00:15:56,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 00:15:56,008 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:56,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:56,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1519210311, now seen corresponding path program 1 times [2025-02-08 00:15:56,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:56,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533441458] [2025-02-08 00:15:56,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:56,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:56,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 00:15:56,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 00:15:56,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:56,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:56,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-08 00:15:56,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533441458] [2025-02-08 00:15:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533441458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:56,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:56,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:56,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199312147] [2025-02-08 00:15:56,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:56,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:56,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:56,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:56,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:56,266 INFO L87 Difference]: Start difference. First operand 1271 states and 1860 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 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-08 00:15:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:56,557 INFO L93 Difference]: Finished difference Result 2543 states and 3721 transitions. [2025-02-08 00:15:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:56,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 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-08 00:15:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:56,560 INFO L225 Difference]: With dead ends: 2543 [2025-02-08 00:15:56,563 INFO L226 Difference]: Without dead ends: 1327 [2025-02-08 00:15:56,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:56,565 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 19 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:56,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3570 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2025-02-08 00:15:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2025-02-08 00:15:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1326 states have (on average 1.4630467571644041) internal successors, (1940), 1326 states have internal predecessors, (1940), 0 states have call successors, (0), 0 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-08 00:15:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1940 transitions. [2025-02-08 00:15:56,575 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1940 transitions. Word has length 157 [2025-02-08 00:15:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:56,576 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1940 transitions. [2025-02-08 00:15:56,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 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-08 00:15:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1940 transitions. [2025-02-08 00:15:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-08 00:15:56,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:56,577 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-08 00:15:56,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 00:15:56,577 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:56,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1447743711, now seen corresponding path program 1 times [2025-02-08 00:15:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666378602] [2025-02-08 00:15:56,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:56,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:56,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 00:15:56,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 00:15:56,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:56,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:56,857 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-08 00:15:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666378602] [2025-02-08 00:15:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666378602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129636223] [2025-02-08 00:15:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:56,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:56,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:56,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:56,859 INFO L87 Difference]: Start difference. First operand 1327 states and 1940 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-08 00:15:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:57,321 INFO L93 Difference]: Finished difference Result 2619 states and 3829 transitions. [2025-02-08 00:15:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-08 00:15:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:57,324 INFO L225 Difference]: With dead ends: 2619 [2025-02-08 00:15:57,324 INFO L226 Difference]: Without dead ends: 1347 [2025-02-08 00:15:57,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:57,326 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4448 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:57,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4448 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-02-08 00:15:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1339. [2025-02-08 00:15:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1338 states have (on average 1.4618834080717489) internal successors, (1956), 1338 states have internal predecessors, (1956), 0 states have call successors, (0), 0 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-08 00:15:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1956 transitions. [2025-02-08 00:15:57,337 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1956 transitions. Word has length 158 [2025-02-08 00:15:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:57,338 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1956 transitions. [2025-02-08 00:15:57,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-08 00:15:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1956 transitions. [2025-02-08 00:15:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-08 00:15:57,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:57,339 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-08 00:15:57,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 00:15:57,339 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:57,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash -447363008, now seen corresponding path program 1 times [2025-02-08 00:15:57,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:57,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337894179] [2025-02-08 00:15:57,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:57,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 00:15:57,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 00:15:57,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:57,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:57,802 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-08 00:15:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337894179] [2025-02-08 00:15:57,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337894179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:57,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:57,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:15:57,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824822428] [2025-02-08 00:15:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:57,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:57,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:57,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:57,804 INFO L87 Difference]: Start difference. First operand 1339 states and 1956 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 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-08 00:15:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:58,253 INFO L93 Difference]: Finished difference Result 2633 states and 3847 transitions. [2025-02-08 00:15:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:58,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 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-08 00:15:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:58,255 INFO L225 Difference]: With dead ends: 2633 [2025-02-08 00:15:58,255 INFO L226 Difference]: Without dead ends: 1349 [2025-02-08 00:15:58,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:58,259 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 4443 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5335 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:58,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5335 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-02-08 00:15:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2025-02-08 00:15:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.459940652818991) internal successors, (1968), 1348 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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-08 00:15:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1968 transitions. [2025-02-08 00:15:58,271 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1968 transitions. Word has length 159 [2025-02-08 00:15:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:58,272 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 1968 transitions. [2025-02-08 00:15:58,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 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-08 00:15:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1968 transitions. [2025-02-08 00:15:58,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-08 00:15:58,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:58,273 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-08 00:15:58,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 00:15:58,273 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:58,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1697467725, now seen corresponding path program 1 times [2025-02-08 00:15:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077335507] [2025-02-08 00:15:58,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:58,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:58,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 00:15:58,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 00:15:58,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:58,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:58,705 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-08 00:15:58,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077335507] [2025-02-08 00:15:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077335507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:58,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600114433] [2025-02-08 00:15:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:58,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:58,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:58,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:58,707 INFO L87 Difference]: Start difference. First operand 1349 states and 1968 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 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-08 00:15:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:59,171 INFO L93 Difference]: Finished difference Result 2735 states and 3987 transitions. [2025-02-08 00:15:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:59,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 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-08 00:15:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:59,173 INFO L225 Difference]: With dead ends: 2735 [2025-02-08 00:15:59,173 INFO L226 Difference]: Without dead ends: 1441 [2025-02-08 00:15:59,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:59,174 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 998 mSDsluCounter, 3473 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:59,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 4346 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:59,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2025-02-08 00:15:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1441. [2025-02-08 00:15:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1440 states have (on average 1.4555555555555555) internal successors, (2096), 1440 states have internal predecessors, (2096), 0 states have call successors, (0), 0 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-08 00:15:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2096 transitions. [2025-02-08 00:15:59,186 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2096 transitions. Word has length 160 [2025-02-08 00:15:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:59,186 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 2096 transitions. [2025-02-08 00:15:59,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 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-08 00:15:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2096 transitions. [2025-02-08 00:15:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-08 00:15:59,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:59,187 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-08 00:15:59,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 00:15:59,187 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:59,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1876805144, now seen corresponding path program 1 times [2025-02-08 00:15:59,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:59,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569172212] [2025-02-08 00:15:59,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:59,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:59,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 00:15:59,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 00:15:59,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:59,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:00,573 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-08 00:16:00,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569172212] [2025-02-08 00:16:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569172212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2025-02-08 00:16:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820420243] [2025-02-08 00:16:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:00,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 00:16:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:00,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 00:16:00,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 00:16:00,575 INFO L87 Difference]: Start difference. First operand 1441 states and 2096 transitions. Second operand has 35 states, 35 states have (on average 4.571428571428571) internal successors, (160), 35 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-08 00:16:03,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:03,878 INFO L93 Difference]: Finished difference Result 3265 states and 4749 transitions. [2025-02-08 00:16:03,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-08 00:16:03,879 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.571428571428571) internal successors, (160), 35 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-08 00:16:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:03,882 INFO L225 Difference]: With dead ends: 3265 [2025-02-08 00:16:03,882 INFO L226 Difference]: Without dead ends: 1879 [2025-02-08 00:16:03,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=1187, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 00:16:03,883 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 133 mSDsluCounter, 32514 mSDsCounter, 0 mSdLazyCounter, 9156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 33507 SdHoareTripleChecker+Invalid, 9157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:03,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 33507 Invalid, 9157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9156 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-08 00:16:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2025-02-08 00:16:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1835. [2025-02-08 00:16:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1834 states have (on average 1.4612868047982552) internal successors, (2680), 1834 states have internal predecessors, (2680), 0 states have call successors, (0), 0 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-08 00:16:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2680 transitions. [2025-02-08 00:16:03,898 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2680 transitions. Word has length 160 [2025-02-08 00:16:03,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:03,898 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2680 transitions. [2025-02-08 00:16:03,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.571428571428571) internal successors, (160), 35 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-08 00:16:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2680 transitions. [2025-02-08 00:16:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-08 00:16:03,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:03,900 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-08 00:16:03,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 00:16:03,900 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1519437317, now seen corresponding path program 1 times [2025-02-08 00:16:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793111461] [2025-02-08 00:16:03,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:03,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 00:16:04,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 00:16:04,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:04,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:04,517 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-08 00:16:04,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:04,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793111461] [2025-02-08 00:16:04,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793111461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:04,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 00:16:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314833602] [2025-02-08 00:16:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:04,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 00:16:04,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:04,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 00:16:04,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:16:04,519 INFO L87 Difference]: Start difference. First operand 1835 states and 2680 transitions. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 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-08 00:16:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:05,485 INFO L93 Difference]: Finished difference Result 3723 states and 5433 transitions. [2025-02-08 00:16:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 00:16:05,486 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 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-08 00:16:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:05,488 INFO L225 Difference]: With dead ends: 3723 [2025-02-08 00:16:05,488 INFO L226 Difference]: Without dead ends: 1943 [2025-02-08 00:16:05,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:16:05,490 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 51 mSDsluCounter, 9813 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 10709 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:05,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 10709 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:16:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-02-08 00:16:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1905. [2025-02-08 00:16:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1904 states have (on average 1.4611344537815125) internal successors, (2782), 1904 states have internal predecessors, (2782), 0 states have call successors, (0), 0 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-08 00:16:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2782 transitions. [2025-02-08 00:16:05,503 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2782 transitions. Word has length 161 [2025-02-08 00:16:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:05,503 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 2782 transitions. [2025-02-08 00:16:05,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 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-08 00:16:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2782 transitions. [2025-02-08 00:16:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-08 00:16:05,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:05,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 00:16:05,505 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:05,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:05,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2085493499, now seen corresponding path program 1 times [2025-02-08 00:16:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:05,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378307141] [2025-02-08 00:16:05,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:05,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:05,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 00:16:05,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 00:16:05,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:05,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:05,910 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-08 00:16:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:05,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378307141] [2025-02-08 00:16:05,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378307141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:05,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:16:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905429431] [2025-02-08 00:16:05,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:16:05,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:05,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:16:05,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:05,911 INFO L87 Difference]: Start difference. First operand 1905 states and 2782 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 5 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-08 00:16:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:06,272 INFO L93 Difference]: Finished difference Result 3763 states and 5493 transitions. [2025-02-08 00:16:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:16:06,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 5 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-08 00:16:06,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:06,275 INFO L225 Difference]: With dead ends: 3763 [2025-02-08 00:16:06,275 INFO L226 Difference]: Without dead ends: 1913 [2025-02-08 00:16:06,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:06,276 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1030 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 3479 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:06,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 3479 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2025-02-08 00:16:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1905. [2025-02-08 00:16:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1904 states have (on average 1.4611344537815125) internal successors, (2782), 1904 states have internal predecessors, (2782), 0 states have call successors, (0), 0 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-08 00:16:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2782 transitions. [2025-02-08 00:16:06,293 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2782 transitions. Word has length 161 [2025-02-08 00:16:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:06,293 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 2782 transitions. [2025-02-08 00:16:06,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 5 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-08 00:16:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2782 transitions. [2025-02-08 00:16:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-08 00:16:06,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:06,295 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-08 00:16:06,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 00:16:06,295 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:06,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1994205202, now seen corresponding path program 1 times [2025-02-08 00:16:06,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:06,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837518008] [2025-02-08 00:16:06,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:06,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 00:16:06,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 00:16:06,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:06,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:06,791 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-08 00:16:06,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:06,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837518008] [2025-02-08 00:16:06,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837518008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:06,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:06,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:16:06,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069480078] [2025-02-08 00:16:06,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:06,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:16:06,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:06,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:16:06,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:06,793 INFO L87 Difference]: Start difference. First operand 1905 states and 2782 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 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-08 00:16:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:07,151 INFO L93 Difference]: Finished difference Result 3785 states and 5529 transitions. [2025-02-08 00:16:07,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 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-08 00:16:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:07,154 INFO L225 Difference]: With dead ends: 3785 [2025-02-08 00:16:07,155 INFO L226 Difference]: Without dead ends: 1935 [2025-02-08 00:16:07,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:07,156 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 4443 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5335 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:07,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5335 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2025-02-08 00:16:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1923. [2025-02-08 00:16:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1922 states have (on average 1.4599375650364204) internal successors, (2806), 1922 states have internal predecessors, (2806), 0 states have call successors, (0), 0 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-08 00:16:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2806 transitions. [2025-02-08 00:16:07,173 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2806 transitions. Word has length 161 [2025-02-08 00:16:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:07,173 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2806 transitions. [2025-02-08 00:16:07,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 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-08 00:16:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2806 transitions. [2025-02-08 00:16:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-08 00:16:07,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:07,175 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-08 00:16:07,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 00:16:07,175 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:07,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:07,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1542734230, now seen corresponding path program 1 times [2025-02-08 00:16:07,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:07,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299645889] [2025-02-08 00:16:07,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:07,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 00:16:07,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 00:16:07,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:07,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:07,583 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-08 00:16:07,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:07,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299645889] [2025-02-08 00:16:07,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299645889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:07,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:07,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:16:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712678986] [2025-02-08 00:16:07,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:07,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:16:07,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:07,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:16:07,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:07,585 INFO L87 Difference]: Start difference. First operand 1923 states and 2806 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 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-08 00:16:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:07,975 INFO L93 Difference]: Finished difference Result 3923 states and 5719 transitions. [2025-02-08 00:16:07,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:07,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 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-08 00:16:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:07,978 INFO L225 Difference]: With dead ends: 3923 [2025-02-08 00:16:07,978 INFO L226 Difference]: Without dead ends: 2055 [2025-02-08 00:16:07,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:07,980 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1004 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:07,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 3478 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2025-02-08 00:16:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 2055. [2025-02-08 00:16:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2054 states have (on average 1.4547224926971762) internal successors, (2988), 2054 states have internal predecessors, (2988), 0 states have call successors, (0), 0 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-08 00:16:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2988 transitions. [2025-02-08 00:16:07,993 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2988 transitions. Word has length 162 [2025-02-08 00:16:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:07,993 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 2988 transitions. [2025-02-08 00:16:07,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 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-08 00:16:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2988 transitions. [2025-02-08 00:16:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-08 00:16:07,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:07,994 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-08 00:16:07,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 00:16:07,995 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:07,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:07,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1120405519, now seen corresponding path program 1 times [2025-02-08 00:16:07,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:07,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274538082] [2025-02-08 00:16:07,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:07,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:08,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 00:16:08,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 00:16:08,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:08,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:08,495 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-08 00:16:08,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274538082] [2025-02-08 00:16:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274538082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:08,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:08,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:16:08,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927219052] [2025-02-08 00:16:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:08,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:16:08,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:08,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:16:08,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:08,498 INFO L87 Difference]: Start difference. First operand 2055 states and 2988 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 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-08 00:16:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:08,950 INFO L93 Difference]: Finished difference Result 4085 states and 5941 transitions. [2025-02-08 00:16:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:08,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 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-08 00:16:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:08,954 INFO L225 Difference]: With dead ends: 4085 [2025-02-08 00:16:08,954 INFO L226 Difference]: Without dead ends: 2085 [2025-02-08 00:16:08,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:08,955 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 4443 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5335 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:08,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5335 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-02-08 00:16:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2073. [2025-02-08 00:16:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2072 states have (on average 1.4536679536679538) internal successors, (3012), 2072 states have internal predecessors, (3012), 0 states have call successors, (0), 0 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-08 00:16:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3012 transitions. [2025-02-08 00:16:08,973 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3012 transitions. Word has length 162 [2025-02-08 00:16:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:08,973 INFO L471 AbstractCegarLoop]: Abstraction has 2073 states and 3012 transitions. [2025-02-08 00:16:08,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 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-08 00:16:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3012 transitions. [2025-02-08 00:16:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 00:16:08,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:08,975 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-08 00:16:08,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 00:16:08,975 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:08,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1269687682, now seen corresponding path program 1 times [2025-02-08 00:16:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:08,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032926960] [2025-02-08 00:16:08,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:09,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 00:16:09,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 00:16:09,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:09,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:09,337 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-08 00:16:09,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:09,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032926960] [2025-02-08 00:16:09,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032926960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:09,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:09,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:16:09,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179332294] [2025-02-08 00:16:09,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:09,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:16:09,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:09,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:16:09,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:09,338 INFO L87 Difference]: Start difference. First operand 2073 states and 3012 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:09,723 INFO L93 Difference]: Finished difference Result 4285 states and 6225 transitions. [2025-02-08 00:16:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:09,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-08 00:16:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:09,726 INFO L225 Difference]: With dead ends: 4285 [2025-02-08 00:16:09,726 INFO L226 Difference]: Without dead ends: 2267 [2025-02-08 00:16:09,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:09,728 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1031 mSDsluCounter, 2604 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:09,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 3477 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2025-02-08 00:16:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2267. [2025-02-08 00:16:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2267 states, 2266 states have (on average 1.4510150044130627) internal successors, (3288), 2266 states have internal predecessors, (3288), 0 states have call successors, (0), 0 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-08 00:16:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 3288 transitions. [2025-02-08 00:16:09,740 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 3288 transitions. Word has length 163 [2025-02-08 00:16:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:09,741 INFO L471 AbstractCegarLoop]: Abstraction has 2267 states and 3288 transitions. [2025-02-08 00:16:09,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 3288 transitions. [2025-02-08 00:16:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 00:16:09,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:09,742 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-08 00:16:09,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 00:16:09,742 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:09,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:09,743 INFO L85 PathProgramCache]: Analyzing trace with hash 334154393, now seen corresponding path program 1 times [2025-02-08 00:16:09,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:09,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983913409] [2025-02-08 00:16:09,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:09,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:09,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 00:16:09,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 00:16:09,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:09,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:10,955 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-08 00:16:10,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:10,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983913409] [2025-02-08 00:16:10,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983913409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:10,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:10,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-08 00:16:10,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310700779] [2025-02-08 00:16:10,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:10,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 00:16:10,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:10,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 00:16:10,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:16:10,957 INFO L87 Difference]: Start difference. First operand 2267 states and 3288 transitions. Second operand has 27 states, 27 states have (on average 6.037037037037037) internal successors, (163), 27 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:12,994 INFO L93 Difference]: Finished difference Result 5145 states and 7457 transitions. [2025-02-08 00:16:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 00:16:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.037037037037037) internal successors, (163), 27 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-08 00:16:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:12,998 INFO L225 Difference]: With dead ends: 5145 [2025-02-08 00:16:13,001 INFO L226 Difference]: Without dead ends: 2933 [2025-02-08 00:16:13,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:16:13,004 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 95 mSDsluCounter, 22500 mSDsCounter, 0 mSdLazyCounter, 5972 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 23445 SdHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:13,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 23445 Invalid, 5974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5972 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-08 00:16:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2025-02-08 00:16:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2821. [2025-02-08 00:16:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2820 states have (on average 1.4560283687943263) internal successors, (4106), 2820 states have internal predecessors, (4106), 0 states have call successors, (0), 0 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-08 00:16:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4106 transitions. [2025-02-08 00:16:13,030 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4106 transitions. Word has length 163 [2025-02-08 00:16:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:13,031 INFO L471 AbstractCegarLoop]: Abstraction has 2821 states and 4106 transitions. [2025-02-08 00:16:13,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.037037037037037) internal successors, (163), 27 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4106 transitions. [2025-02-08 00:16:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 00:16:13,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:13,032 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-08 00:16:13,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 00:16:13,032 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:13,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1815010083, now seen corresponding path program 1 times [2025-02-08 00:16:13,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:13,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341253109] [2025-02-08 00:16:13,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:13,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:13,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 00:16:13,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 00:16:13,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:13,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:13,426 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-08 00:16:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341253109] [2025-02-08 00:16:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341253109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:13,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:13,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:16:13,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824188044] [2025-02-08 00:16:13,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:13,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:16:13,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:13,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:16:13,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:13,427 INFO L87 Difference]: Start difference. First operand 2821 states and 4106 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:13,799 INFO L93 Difference]: Finished difference Result 5535 states and 8051 transitions. [2025-02-08 00:16:13,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:13,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-08 00:16:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:13,802 INFO L225 Difference]: With dead ends: 5535 [2025-02-08 00:16:13,802 INFO L226 Difference]: Without dead ends: 2769 [2025-02-08 00:16:13,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:16:13,804 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1023 mSDsluCounter, 2609 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 3482 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:13,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 3482 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2025-02-08 00:16:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 2769. [2025-02-08 00:16:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2769 states, 2768 states have (on average 1.4515895953757225) internal successors, (4018), 2768 states have internal predecessors, (4018), 0 states have call successors, (0), 0 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-08 00:16:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 4018 transitions. [2025-02-08 00:16:13,820 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 4018 transitions. Word has length 163 [2025-02-08 00:16:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:13,820 INFO L471 AbstractCegarLoop]: Abstraction has 2769 states and 4018 transitions. [2025-02-08 00:16:13,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 4018 transitions. [2025-02-08 00:16:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 00:16:13,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:13,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:13,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 00:16:13,822 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:13,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1902913138, now seen corresponding path program 1 times [2025-02-08 00:16:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481424201] [2025-02-08 00:16:13,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:13,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 00:16:13,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 00:16:13,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:13,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:14,335 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-08 00:16:14,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:14,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481424201] [2025-02-08 00:16:14,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481424201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:14,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:14,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 00:16:14,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019398634] [2025-02-08 00:16:14,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:14,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 00:16:14,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:14,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 00:16:14,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:16:14,337 INFO L87 Difference]: Start difference. First operand 2769 states and 4018 transitions. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:14,905 INFO L93 Difference]: Finished difference Result 5643 states and 8183 transitions. [2025-02-08 00:16:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:16:14,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-08 00:16:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:14,909 INFO L225 Difference]: With dead ends: 5643 [2025-02-08 00:16:14,909 INFO L226 Difference]: Without dead ends: 2929 [2025-02-08 00:16:14,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:16:14,912 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 34 mSDsluCounter, 5376 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6266 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:14,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6266 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:16:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2025-02-08 00:16:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2845. [2025-02-08 00:16:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2844 states have (on average 1.450773558368495) internal successors, (4126), 2844 states have internal predecessors, (4126), 0 states have call successors, (0), 0 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-08 00:16:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4126 transitions. [2025-02-08 00:16:14,929 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4126 transitions. Word has length 163 [2025-02-08 00:16:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:14,929 INFO L471 AbstractCegarLoop]: Abstraction has 2845 states and 4126 transitions. [2025-02-08 00:16:14,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4126 transitions. [2025-02-08 00:16:14,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 00:16:14,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:14,931 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-08 00:16:14,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 00:16:14,932 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:14,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash 973552252, now seen corresponding path program 1 times [2025-02-08 00:16:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:14,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954233708] [2025-02-08 00:16:14,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:14,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 00:16:15,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 00:16:15,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:15,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:15,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:15,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954233708] [2025-02-08 00:16:15,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954233708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:15,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:15,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:16:15,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324833991] [2025-02-08 00:16:15,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:15,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:16:15,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:15,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:16:15,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:15,306 INFO L87 Difference]: Start difference. First operand 2845 states and 4126 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:15,693 INFO L93 Difference]: Finished difference Result 5731 states and 8315 transitions. [2025-02-08 00:16:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:15,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-08 00:16:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:15,696 INFO L225 Difference]: With dead ends: 5731 [2025-02-08 00:16:15,696 INFO L226 Difference]: Without dead ends: 2941 [2025-02-08 00:16:15,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:16:15,698 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1001 mSDsluCounter, 3477 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 4350 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:15,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 4350 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2025-02-08 00:16:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2941. [2025-02-08 00:16:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2940 states have (on average 1.44421768707483) internal successors, (4246), 2940 states have internal predecessors, (4246), 0 states have call successors, (0), 0 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-08 00:16:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 4246 transitions. [2025-02-08 00:16:15,715 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 4246 transitions. Word has length 163 [2025-02-08 00:16:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:15,715 INFO L471 AbstractCegarLoop]: Abstraction has 2941 states and 4246 transitions. [2025-02-08 00:16:15,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 4246 transitions. [2025-02-08 00:16:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 00:16:15,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:15,716 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-08 00:16:15,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 00:16:15,716 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:15,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:15,717 INFO L85 PathProgramCache]: Analyzing trace with hash 470320156, now seen corresponding path program 1 times [2025-02-08 00:16:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:15,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798947360] [2025-02-08 00:16:15,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:15,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 00:16:15,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 00:16:15,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:15,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:16,207 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-08 00:16:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798947360] [2025-02-08 00:16:16,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798947360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:16,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:16,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 00:16:16,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34214427] [2025-02-08 00:16:16,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:16,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 00:16:16,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:16,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 00:16:16,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:16:16,208 INFO L87 Difference]: Start difference. First operand 2941 states and 4246 transitions. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:16,978 INFO L93 Difference]: Finished difference Result 5837 states and 8425 transitions. [2025-02-08 00:16:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:16:16,979 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-08 00:16:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:16,981 INFO L225 Difference]: With dead ends: 5837 [2025-02-08 00:16:16,981 INFO L226 Difference]: Without dead ends: 2951 [2025-02-08 00:16:16,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:16:16,983 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 12 mSDsluCounter, 7956 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8843 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:16,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8843 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:16:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2025-02-08 00:16:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2947. [2025-02-08 00:16:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2946 states have (on average 1.4439918533604887) internal successors, (4254), 2946 states have internal predecessors, (4254), 0 states have call successors, (0), 0 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-08 00:16:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4254 transitions. [2025-02-08 00:16:16,998 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4254 transitions. Word has length 163 [2025-02-08 00:16:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:16,998 INFO L471 AbstractCegarLoop]: Abstraction has 2947 states and 4254 transitions. [2025-02-08 00:16:16,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4254 transitions. [2025-02-08 00:16:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 00:16:17,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:17,000 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-08 00:16:17,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 00:16:17,000 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:17,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash -532864361, now seen corresponding path program 1 times [2025-02-08 00:16:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:17,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565749217] [2025-02-08 00:16:17,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:17,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:17,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 00:16:17,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 00:16:17,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:17,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:17,351 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-08 00:16:17,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565749217] [2025-02-08 00:16:17,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565749217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:17,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:17,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:16:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772930340] [2025-02-08 00:16:17,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:17,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:16:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:17,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:16:17,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:17,352 INFO L87 Difference]: Start difference. First operand 2947 states and 4254 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:17,716 INFO L93 Difference]: Finished difference Result 5867 states and 8465 transitions. [2025-02-08 00:16:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:17,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-08 00:16:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:17,719 INFO L225 Difference]: With dead ends: 5867 [2025-02-08 00:16:17,719 INFO L226 Difference]: Without dead ends: 2975 [2025-02-08 00:16:17,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:17,721 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1053 mSDsluCounter, 2604 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:17,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 3477 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2025-02-08 00:16:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2975. [2025-02-08 00:16:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2974 states have (on average 1.4418291862811028) internal successors, (4288), 2974 states have internal predecessors, (4288), 0 states have call successors, (0), 0 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-08 00:16:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4288 transitions. [2025-02-08 00:16:17,738 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4288 transitions. Word has length 163 [2025-02-08 00:16:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:17,738 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 4288 transitions. [2025-02-08 00:16:17,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 00:16:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4288 transitions. [2025-02-08 00:16:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 00:16:17,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:17,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:17,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 00:16:17,740 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:17,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1010278886, now seen corresponding path program 1 times [2025-02-08 00:16:17,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:17,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109557188] [2025-02-08 00:16:17,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:17,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:17,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 00:16:17,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 00:16:17,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:17,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:18,252 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-08 00:16:18,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:18,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109557188] [2025-02-08 00:16:18,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109557188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:18,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:18,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 00:16:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085458165] [2025-02-08 00:16:18,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:18,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 00:16:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:18,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 00:16:18,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:16:18,253 INFO L87 Difference]: Start difference. First operand 2975 states and 4288 transitions. Second operand has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-08 00:16:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:18,770 INFO L93 Difference]: Finished difference Result 6027 states and 8683 transitions. [2025-02-08 00:16:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:16:18,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-08 00:16:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:18,773 INFO L225 Difference]: With dead ends: 6027 [2025-02-08 00:16:18,773 INFO L226 Difference]: Without dead ends: 3107 [2025-02-08 00:16:18,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:16:18,777 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 36 mSDsluCounter, 5382 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 6273 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:18,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 6273 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:16:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2025-02-08 00:16:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3039. [2025-02-08 00:16:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3039 states, 3038 states have (on average 1.4417379855167873) internal successors, (4380), 3038 states have internal predecessors, (4380), 0 states have call successors, (0), 0 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-08 00:16:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4380 transitions. [2025-02-08 00:16:18,803 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4380 transitions. Word has length 164 [2025-02-08 00:16:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:18,803 INFO L471 AbstractCegarLoop]: Abstraction has 3039 states and 4380 transitions. [2025-02-08 00:16:18,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-08 00:16:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4380 transitions. [2025-02-08 00:16:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 00:16:18,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:18,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:18,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 00:16:18,805 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:18,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash -338029148, now seen corresponding path program 1 times [2025-02-08 00:16:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:18,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405454162] [2025-02-08 00:16:18,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:18,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:18,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 00:16:18,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 00:16:18,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:18,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:19,222 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-08 00:16:19,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:19,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405454162] [2025-02-08 00:16:19,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405454162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:19,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:19,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:16:19,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735551704] [2025-02-08 00:16:19,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:19,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:16:19,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:19,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:16:19,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:19,224 INFO L87 Difference]: Start difference. First operand 3039 states and 4380 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-08 00:16:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:19,602 INFO L93 Difference]: Finished difference Result 6115 states and 8817 transitions. [2025-02-08 00:16:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:19,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-08 00:16:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:19,606 INFO L225 Difference]: With dead ends: 6115 [2025-02-08 00:16:19,606 INFO L226 Difference]: Without dead ends: 3131 [2025-02-08 00:16:19,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:16:19,609 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 978 mSDsluCounter, 3477 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 4350 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:19,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 4350 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2025-02-08 00:16:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3131. [2025-02-08 00:16:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 3130 states have (on average 1.4364217252396165) internal successors, (4496), 3130 states have internal predecessors, (4496), 0 states have call successors, (0), 0 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-08 00:16:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 4496 transitions. [2025-02-08 00:16:19,632 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 4496 transitions. Word has length 164 [2025-02-08 00:16:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:19,632 INFO L471 AbstractCegarLoop]: Abstraction has 3131 states and 4496 transitions. [2025-02-08 00:16:19,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-08 00:16:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4496 transitions. [2025-02-08 00:16:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 00:16:19,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:19,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:19,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 00:16:19,634 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:19,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash 627964798, now seen corresponding path program 1 times [2025-02-08 00:16:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:19,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604141155] [2025-02-08 00:16:19,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:19,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:19,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 00:16:19,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 00:16:19,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:19,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:20,032 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-08 00:16:20,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:20,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604141155] [2025-02-08 00:16:20,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604141155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:20,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:20,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:16:20,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112108377] [2025-02-08 00:16:20,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:20,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:16:20,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:20,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:16:20,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:20,033 INFO L87 Difference]: Start difference. First operand 3131 states and 4496 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-08 00:16:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:20,469 INFO L93 Difference]: Finished difference Result 6259 states and 8979 transitions. [2025-02-08 00:16:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:20,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-08 00:16:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:20,471 INFO L225 Difference]: With dead ends: 6259 [2025-02-08 00:16:20,471 INFO L226 Difference]: Without dead ends: 3183 [2025-02-08 00:16:20,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:16:20,474 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1036 mSDsluCounter, 3473 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:20,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 4346 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2025-02-08 00:16:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3127. [2025-02-08 00:16:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 3126 states have (on average 1.436980166346769) internal successors, (4492), 3126 states have internal predecessors, (4492), 0 states have call successors, (0), 0 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-08 00:16:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 4492 transitions. [2025-02-08 00:16:20,516 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 4492 transitions. Word has length 164 [2025-02-08 00:16:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:20,516 INFO L471 AbstractCegarLoop]: Abstraction has 3127 states and 4492 transitions. [2025-02-08 00:16:20,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-08 00:16:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 4492 transitions. [2025-02-08 00:16:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 00:16:20,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:20,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:20,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-08 00:16:20,518 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:20,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:20,518 INFO L85 PathProgramCache]: Analyzing trace with hash -789083370, now seen corresponding path program 1 times [2025-02-08 00:16:20,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:20,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349590865] [2025-02-08 00:16:20,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:20,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 00:16:20,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 00:16:20,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:20,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:21,096 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-08 00:16:21,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:21,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349590865] [2025-02-08 00:16:21,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349590865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:21,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:21,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 00:16:21,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504321921] [2025-02-08 00:16:21,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:21,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 00:16:21,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:21,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 00:16:21,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:16:21,097 INFO L87 Difference]: Start difference. First operand 3127 states and 4492 transitions. Second operand has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-08 00:16:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:21,878 INFO L93 Difference]: Finished difference Result 6403 states and 9191 transitions. [2025-02-08 00:16:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 00:16:21,878 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-08 00:16:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:21,880 INFO L225 Difference]: With dead ends: 6403 [2025-02-08 00:16:21,880 INFO L226 Difference]: Without dead ends: 3331 [2025-02-08 00:16:21,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:16:21,882 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 46 mSDsluCounter, 9671 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 10553 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:21,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 10553 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:16:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2025-02-08 00:16:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3121. [2025-02-08 00:16:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 3120 states have (on average 1.4371794871794872) internal successors, (4484), 3120 states have internal predecessors, (4484), 0 states have call successors, (0), 0 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-08 00:16:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4484 transitions. [2025-02-08 00:16:21,897 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4484 transitions. Word has length 164 [2025-02-08 00:16:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:21,898 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 4484 transitions. [2025-02-08 00:16:21,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-08 00:16:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4484 transitions. [2025-02-08 00:16:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 00:16:21,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:21,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:21,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-08 00:16:21,900 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:21,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1864995686, now seen corresponding path program 1 times [2025-02-08 00:16:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:21,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482130574] [2025-02-08 00:16:21,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:21,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 00:16:21,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 00:16:21,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:22,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:22,826 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-08 00:16:22,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:22,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482130574] [2025-02-08 00:16:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482130574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:22,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-02-08 00:16:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109038907] [2025-02-08 00:16:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:22,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 00:16:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:22,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 00:16:22,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2025-02-08 00:16:22,827 INFO L87 Difference]: Start difference. First operand 3121 states and 4484 transitions. Second operand has 25 states, 25 states have (on average 6.56) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-08 00:16:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:24,520 INFO L93 Difference]: Finished difference Result 6817 states and 9773 transitions. [2025-02-08 00:16:24,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 00:16:24,522 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.56) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-08 00:16:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:24,524 INFO L225 Difference]: With dead ends: 6817 [2025-02-08 00:16:24,524 INFO L226 Difference]: Without dead ends: 3751 [2025-02-08 00:16:24,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2025-02-08 00:16:24,526 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 101 mSDsluCounter, 19095 mSDsCounter, 0 mSdLazyCounter, 5194 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 19965 SdHoareTripleChecker+Invalid, 5208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:24,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 19965 Invalid, 5208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 5194 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 00:16:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2025-02-08 00:16:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3513. [2025-02-08 00:16:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3513 states, 3512 states have (on average 1.4350797266514805) internal successors, (5040), 3512 states have internal predecessors, (5040), 0 states have call successors, (0), 0 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-08 00:16:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 5040 transitions. [2025-02-08 00:16:24,544 INFO L78 Accepts]: Start accepts. Automaton has 3513 states and 5040 transitions. Word has length 164 [2025-02-08 00:16:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:24,544 INFO L471 AbstractCegarLoop]: Abstraction has 3513 states and 5040 transitions. [2025-02-08 00:16:24,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.56) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-08 00:16:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 5040 transitions. [2025-02-08 00:16:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 00:16:24,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:24,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:24,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-08 00:16:24,547 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:24,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1402936774, now seen corresponding path program 1 times [2025-02-08 00:16:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:24,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944508302] [2025-02-08 00:16:24,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:24,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 00:16:24,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 00:16:24,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:24,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:24,992 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-08 00:16:24,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:24,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944508302] [2025-02-08 00:16:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944508302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:24,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:24,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:16:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584873471] [2025-02-08 00:16:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:16:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:24,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:16:24,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:16:24,994 INFO L87 Difference]: Start difference. First operand 3513 states and 5040 transitions. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 00:16:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:25,488 INFO L93 Difference]: Finished difference Result 7023 states and 10073 transitions. [2025-02-08 00:16:25,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:16:25,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-08 00:16:25,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:25,492 INFO L225 Difference]: With dead ends: 7023 [2025-02-08 00:16:25,492 INFO L226 Difference]: Without dead ends: 3565 [2025-02-08 00:16:25,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:16:25,494 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 1040 mSDsluCounter, 4358 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 5234 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:25,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 5234 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:16:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2025-02-08 00:16:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 3553. [2025-02-08 00:16:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 3552 states have (on average 1.4335585585585586) internal successors, (5092), 3552 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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-08 00:16:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 5092 transitions. [2025-02-08 00:16:25,539 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 5092 transitions. Word has length 165 [2025-02-08 00:16:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:25,539 INFO L471 AbstractCegarLoop]: Abstraction has 3553 states and 5092 transitions. [2025-02-08 00:16:25,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 00:16:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 5092 transitions. [2025-02-08 00:16:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 00:16:25,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:25,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:25,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-08 00:16:25,542 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:25,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash 639529568, now seen corresponding path program 1 times [2025-02-08 00:16:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:25,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731191544] [2025-02-08 00:16:25,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:25,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 00:16:25,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 00:16:25,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:25,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:25,909 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-08 00:16:25,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:25,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731191544] [2025-02-08 00:16:25,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731191544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:25,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:25,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:16:25,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374489773] [2025-02-08 00:16:25,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:25,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:16:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:25,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:16:25,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:16:25,913 INFO L87 Difference]: Start difference. First operand 3553 states and 5092 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 00:16:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:26,578 INFO L93 Difference]: Finished difference Result 8645 states and 12373 transitions. [2025-02-08 00:16:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:16:26,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-08 00:16:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:26,583 INFO L225 Difference]: With dead ends: 8645 [2025-02-08 00:16:26,583 INFO L226 Difference]: Without dead ends: 5147 [2025-02-08 00:16:26,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:16:26,588 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 1886 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:26,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1886 Valid, 2025 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:16:26,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2025-02-08 00:16:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 3580. [2025-02-08 00:16:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 3579 states have (on average 1.4333612740989103) internal successors, (5130), 3579 states have internal predecessors, (5130), 0 states have call successors, (0), 0 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-08 00:16:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 5130 transitions. [2025-02-08 00:16:26,614 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 5130 transitions. Word has length 165 [2025-02-08 00:16:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:26,615 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 5130 transitions. [2025-02-08 00:16:26,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 00:16:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 5130 transitions. [2025-02-08 00:16:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 00:16:26,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:26,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:26,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-08 00:16:26,617 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:26,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash -885838920, now seen corresponding path program 1 times [2025-02-08 00:16:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:26,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174993509] [2025-02-08 00:16:26,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:26,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 00:16:26,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 00:16:26,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:26,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:27,445 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-08 00:16:27,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:27,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174993509] [2025-02-08 00:16:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174993509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:27,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:27,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 00:16:27,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896287922] [2025-02-08 00:16:27,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:27,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 00:16:27,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:27,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 00:16:27,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:16:27,447 INFO L87 Difference]: Start difference. First operand 3580 states and 5130 transitions. Second operand has 17 states, 17 states have (on average 9.705882352941176) internal successors, (165), 17 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 00:16:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:28,653 INFO L93 Difference]: Finished difference Result 7856 states and 11251 transitions. [2025-02-08 00:16:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 00:16:28,653 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.705882352941176) internal successors, (165), 17 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-08 00:16:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:28,658 INFO L225 Difference]: With dead ends: 7856 [2025-02-08 00:16:28,658 INFO L226 Difference]: Without dead ends: 4358 [2025-02-08 00:16:28,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:16:28,661 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 68 mSDsluCounter, 12205 mSDsCounter, 0 mSdLazyCounter, 3067 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 13080 SdHoareTripleChecker+Invalid, 3070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:28,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 13080 Invalid, 3070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3067 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 00:16:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4358 states. [2025-02-08 00:16:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4358 to 3942. [2025-02-08 00:16:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3941 states have (on average 1.4371986805379344) internal successors, (5664), 3941 states have internal predecessors, (5664), 0 states have call successors, (0), 0 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-08 00:16:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 5664 transitions. [2025-02-08 00:16:28,693 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 5664 transitions. Word has length 165 [2025-02-08 00:16:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:28,693 INFO L471 AbstractCegarLoop]: Abstraction has 3942 states and 5664 transitions. [2025-02-08 00:16:28,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.705882352941176) internal successors, (165), 17 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 00:16:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 5664 transitions. [2025-02-08 00:16:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 00:16:28,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:28,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:28,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-08 00:16:28,696 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:28,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1687088051, now seen corresponding path program 1 times [2025-02-08 00:16:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:28,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860702940] [2025-02-08 00:16:28,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:28,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 00:16:28,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 00:16:28,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:28,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:29,151 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-08 00:16:29,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:29,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860702940] [2025-02-08 00:16:29,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860702940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:29,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:29,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:16:29,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600618975] [2025-02-08 00:16:29,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:29,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:16:29,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:29,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:16:29,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:16:29,152 INFO L87 Difference]: Start difference. First operand 3942 states and 5664 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 00:16:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:29,424 INFO L93 Difference]: Finished difference Result 7946 states and 11425 transitions. [2025-02-08 00:16:29,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:16:29,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-08 00:16:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:29,428 INFO L225 Difference]: With dead ends: 7946 [2025-02-08 00:16:29,428 INFO L226 Difference]: Without dead ends: 4086 [2025-02-08 00:16:29,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:16:29,431 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 5 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:29,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3564 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4086 states. [2025-02-08 00:16:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4086 to 3910. [2025-02-08 00:16:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3910 states, 3909 states have (on average 1.4274750575594781) internal successors, (5580), 3909 states have internal predecessors, (5580), 0 states have call successors, (0), 0 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-08 00:16:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3910 states to 3910 states and 5580 transitions. [2025-02-08 00:16:29,457 INFO L78 Accepts]: Start accepts. Automaton has 3910 states and 5580 transitions. Word has length 165 [2025-02-08 00:16:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:29,458 INFO L471 AbstractCegarLoop]: Abstraction has 3910 states and 5580 transitions. [2025-02-08 00:16:29,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 00:16:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3910 states and 5580 transitions. [2025-02-08 00:16:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 00:16:29,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:29,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:29,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-08 00:16:29,460 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:29,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash 449649815, now seen corresponding path program 1 times [2025-02-08 00:16:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:29,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487919537] [2025-02-08 00:16:29,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:29,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:29,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 00:16:29,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 00:16:29,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:29,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:29,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487919537] [2025-02-08 00:16:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487919537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:29,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:29,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:16:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007068284] [2025-02-08 00:16:29,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:29,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:16:29,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:29,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:16:29,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:29,878 INFO L87 Difference]: Start difference. First operand 3910 states and 5580 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 00:16:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:30,233 INFO L93 Difference]: Finished difference Result 7778 states and 11091 transitions. [2025-02-08 00:16:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:16:30,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-08 00:16:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:30,236 INFO L225 Difference]: With dead ends: 7778 [2025-02-08 00:16:30,236 INFO L226 Difference]: Without dead ends: 3950 [2025-02-08 00:16:30,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:30,238 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1010 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 3479 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:30,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 3479 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2025-02-08 00:16:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3930. [2025-02-08 00:16:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3930 states, 3929 states have (on average 1.4252990582845508) internal successors, (5600), 3929 states have internal predecessors, (5600), 0 states have call successors, (0), 0 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-08 00:16:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 5600 transitions. [2025-02-08 00:16:30,263 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 5600 transitions. Word has length 165 [2025-02-08 00:16:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:30,263 INFO L471 AbstractCegarLoop]: Abstraction has 3930 states and 5600 transitions. [2025-02-08 00:16:30,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-08 00:16:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 5600 transitions. [2025-02-08 00:16:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-08 00:16:30,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:30,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:30,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-08 00:16:30,267 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:30,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:30,267 INFO L85 PathProgramCache]: Analyzing trace with hash 791204382, now seen corresponding path program 1 times [2025-02-08 00:16:30,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:30,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235660934] [2025-02-08 00:16:30,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:30,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 00:16:30,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 00:16:30,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:30,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:30,607 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-08 00:16:30,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:30,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235660934] [2025-02-08 00:16:30,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235660934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:30,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:30,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:16:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128097821] [2025-02-08 00:16:30,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:30,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:16:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:30,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:16:30,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:16:30,608 INFO L87 Difference]: Start difference. First operand 3930 states and 5600 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-08 00:16:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:30,929 INFO L93 Difference]: Finished difference Result 8489 states and 12074 transitions. [2025-02-08 00:16:30,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:16:30,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-02-08 00:16:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:30,933 INFO L225 Difference]: With dead ends: 8489 [2025-02-08 00:16:30,933 INFO L226 Difference]: Without dead ends: 4640 [2025-02-08 00:16:30,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:16:30,936 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1857 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:30,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 2632 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:30,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2025-02-08 00:16:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 3929. [2025-02-08 00:16:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3929 states, 3928 states have (on average 1.425152749490835) internal successors, (5598), 3928 states have internal predecessors, (5598), 0 states have call successors, (0), 0 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-08 00:16:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 5598 transitions. [2025-02-08 00:16:30,966 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 5598 transitions. Word has length 166 [2025-02-08 00:16:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:30,966 INFO L471 AbstractCegarLoop]: Abstraction has 3929 states and 5598 transitions. [2025-02-08 00:16:30,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-08 00:16:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 5598 transitions. [2025-02-08 00:16:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-08 00:16:30,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:30,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:30,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-08 00:16:30,968 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:30,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1507196317, now seen corresponding path program 1 times [2025-02-08 00:16:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:30,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905929632] [2025-02-08 00:16:30,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:30,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:31,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 00:16:31,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 00:16:31,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:31,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:31,688 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-08 00:16:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:31,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905929632] [2025-02-08 00:16:31,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905929632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:31,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:31,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 00:16:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088168914] [2025-02-08 00:16:31,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:31,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 00:16:31,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:31,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 00:16:31,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:16:31,689 INFO L87 Difference]: Start difference. First operand 3929 states and 5598 transitions. Second operand has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-08 00:16:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:32,806 INFO L93 Difference]: Finished difference Result 7961 states and 11349 transitions. [2025-02-08 00:16:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 00:16:32,807 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-02-08 00:16:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:32,809 INFO L225 Difference]: With dead ends: 7961 [2025-02-08 00:16:32,809 INFO L226 Difference]: Without dead ends: 4113 [2025-02-08 00:16:32,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:16:32,811 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 41 mSDsluCounter, 11813 mSDsCounter, 0 mSdLazyCounter, 2963 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 12728 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:32,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 12728 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2963 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 00:16:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2025-02-08 00:16:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3873. [2025-02-08 00:16:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3873 states, 3872 states have (on average 1.4256198347107438) internal successors, (5520), 3872 states have internal predecessors, (5520), 0 states have call successors, (0), 0 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-08 00:16:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 5520 transitions. [2025-02-08 00:16:32,848 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 5520 transitions. Word has length 166 [2025-02-08 00:16:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:32,849 INFO L471 AbstractCegarLoop]: Abstraction has 3873 states and 5520 transitions. [2025-02-08 00:16:32,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-08 00:16:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 5520 transitions. [2025-02-08 00:16:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 00:16:32,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:32,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:32,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-08 00:16:32,850 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1613544493, now seen corresponding path program 1 times [2025-02-08 00:16:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:32,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406615663] [2025-02-08 00:16:32,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:32,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 00:16:32,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 00:16:32,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:32,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:33,253 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-08 00:16:33,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:33,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406615663] [2025-02-08 00:16:33,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406615663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:33,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:33,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:16:33,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363026820] [2025-02-08 00:16:33,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:33,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:16:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:33,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:16:33,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:33,255 INFO L87 Difference]: Start difference. First operand 3873 states and 5520 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-08 00:16:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:33,717 INFO L93 Difference]: Finished difference Result 7803 states and 11123 transitions. [2025-02-08 00:16:33,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:33,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-08 00:16:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:33,720 INFO L225 Difference]: With dead ends: 7803 [2025-02-08 00:16:33,720 INFO L226 Difference]: Without dead ends: 4011 [2025-02-08 00:16:33,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:16:33,722 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 970 mSDsluCounter, 3473 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:33,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 4346 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2025-02-08 00:16:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 4011. [2025-02-08 00:16:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4011 states, 4010 states have (on average 1.424937655860349) internal successors, (5714), 4010 states have internal predecessors, (5714), 0 states have call successors, (0), 0 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-08 00:16:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 4011 states and 5714 transitions. [2025-02-08 00:16:33,741 INFO L78 Accepts]: Start accepts. Automaton has 4011 states and 5714 transitions. Word has length 167 [2025-02-08 00:16:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:33,742 INFO L471 AbstractCegarLoop]: Abstraction has 4011 states and 5714 transitions. [2025-02-08 00:16:33,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-08 00:16:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 5714 transitions. [2025-02-08 00:16:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 00:16:33,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:33,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:33,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-08 00:16:33,743 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:33,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash -782006848, now seen corresponding path program 1 times [2025-02-08 00:16:33,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:33,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897028307] [2025-02-08 00:16:33,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:33,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 00:16:33,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 00:16:33,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:33,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:34,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-08 00:16:34,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:34,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897028307] [2025-02-08 00:16:34,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897028307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:34,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:34,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:16:34,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256576415] [2025-02-08 00:16:34,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:34,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:16:34,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:34,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:16:34,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:34,064 INFO L87 Difference]: Start difference. First operand 4011 states and 5714 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-08 00:16:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:34,436 INFO L93 Difference]: Finished difference Result 7959 states and 11339 transitions. [2025-02-08 00:16:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:34,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-08 00:16:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:34,439 INFO L225 Difference]: With dead ends: 7959 [2025-02-08 00:16:34,439 INFO L226 Difference]: Without dead ends: 4029 [2025-02-08 00:16:34,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:34,441 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4448 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:34,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4448 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states. [2025-02-08 00:16:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 3077. [2025-02-08 00:16:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.4193758127438232) internal successors, (4366), 3076 states have internal predecessors, (4366), 0 states have call successors, (0), 0 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-08 00:16:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4366 transitions. [2025-02-08 00:16:34,472 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4366 transitions. Word has length 167 [2025-02-08 00:16:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:34,472 INFO L471 AbstractCegarLoop]: Abstraction has 3077 states and 4366 transitions. [2025-02-08 00:16:34,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-08 00:16:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4366 transitions. [2025-02-08 00:16:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 00:16:34,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:34,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:34,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-08 00:16:34,474 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:34,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:34,474 INFO L85 PathProgramCache]: Analyzing trace with hash -892943182, now seen corresponding path program 1 times [2025-02-08 00:16:34,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:34,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189997467] [2025-02-08 00:16:34,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:34,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 00:16:34,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 00:16:34,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:34,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:35,602 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-08 00:16:35,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:35,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189997467] [2025-02-08 00:16:35,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189997467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:35,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:35,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-08 00:16:35,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124950057] [2025-02-08 00:16:35,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:35,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 00:16:35,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:35,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 00:16:35,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:16:35,604 INFO L87 Difference]: Start difference. First operand 3077 states and 4366 transitions. Second operand has 27 states, 27 states have (on average 6.185185185185185) internal successors, (167), 27 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-08 00:16:37,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:37,574 INFO L93 Difference]: Finished difference Result 7047 states and 9997 transitions. [2025-02-08 00:16:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 00:16:37,574 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.185185185185185) internal successors, (167), 27 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-08 00:16:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:37,577 INFO L225 Difference]: With dead ends: 7047 [2025-02-08 00:16:37,577 INFO L226 Difference]: Without dead ends: 4051 [2025-02-08 00:16:37,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:16:37,579 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 93 mSDsluCounter, 19720 mSDsCounter, 0 mSdLazyCounter, 5335 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 20578 SdHoareTripleChecker+Invalid, 5349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:37,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 20578 Invalid, 5349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 5335 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 00:16:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2025-02-08 00:16:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 3971. [2025-02-08 00:16:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3970 states have (on average 1.420654911838791) internal successors, (5640), 3970 states have internal predecessors, (5640), 0 states have call successors, (0), 0 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-08 00:16:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5640 transitions. [2025-02-08 00:16:37,599 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5640 transitions. Word has length 167 [2025-02-08 00:16:37,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:37,599 INFO L471 AbstractCegarLoop]: Abstraction has 3971 states and 5640 transitions. [2025-02-08 00:16:37,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.185185185185185) internal successors, (167), 27 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-08 00:16:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5640 transitions. [2025-02-08 00:16:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 00:16:37,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:37,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-08 00:16:37,600 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:37,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2091264744, now seen corresponding path program 1 times [2025-02-08 00:16:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:37,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207390706] [2025-02-08 00:16:37,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:37,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 00:16:37,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 00:16:37,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:37,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:37,988 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-08 00:16:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207390706] [2025-02-08 00:16:37,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207390706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:37,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:37,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:16:37,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078764388] [2025-02-08 00:16:37,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:37,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:16:37,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:37,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:16:37,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:37,989 INFO L87 Difference]: Start difference. First operand 3971 states and 5640 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-08 00:16:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:38,465 INFO L93 Difference]: Finished difference Result 7909 states and 11235 transitions. [2025-02-08 00:16:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:38,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-08 00:16:38,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:38,468 INFO L225 Difference]: With dead ends: 7909 [2025-02-08 00:16:38,468 INFO L226 Difference]: Without dead ends: 4019 [2025-02-08 00:16:38,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:16:38,470 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 954 mSDsluCounter, 3477 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 4350 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:38,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 4350 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2025-02-08 00:16:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 4019. [2025-02-08 00:16:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4019 states, 4018 states have (on average 1.4186162269785962) internal successors, (5700), 4018 states have internal predecessors, (5700), 0 states have call successors, (0), 0 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-08 00:16:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5700 transitions. [2025-02-08 00:16:38,521 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5700 transitions. Word has length 167 [2025-02-08 00:16:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:38,522 INFO L471 AbstractCegarLoop]: Abstraction has 4019 states and 5700 transitions. [2025-02-08 00:16:38,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-08 00:16:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5700 transitions. [2025-02-08 00:16:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 00:16:38,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:38,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:38,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-08 00:16:38,523 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:38,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:38,523 INFO L85 PathProgramCache]: Analyzing trace with hash -442064316, now seen corresponding path program 1 times [2025-02-08 00:16:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:38,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889709779] [2025-02-08 00:16:38,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:38,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:38,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 00:16:38,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 00:16:38,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:38,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:38,810 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-08 00:16:38,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:38,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889709779] [2025-02-08 00:16:38,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889709779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:38,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:38,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:16:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260013127] [2025-02-08 00:16:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:38,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:16:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:38,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:16:38,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:16:38,811 INFO L87 Difference]: Start difference. First operand 4019 states and 5700 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-08 00:16:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:39,510 INFO L93 Difference]: Finished difference Result 8953 states and 12675 transitions. [2025-02-08 00:16:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:16:39,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-08 00:16:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:39,515 INFO L225 Difference]: With dead ends: 8953 [2025-02-08 00:16:39,516 INFO L226 Difference]: Without dead ends: 5015 [2025-02-08 00:16:39,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:16:39,519 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 1836 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:39,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 2025 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:16:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5015 states. [2025-02-08 00:16:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5015 to 4061. [2025-02-08 00:16:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4061 states, 4060 states have (on average 1.4172413793103449) internal successors, (5754), 4060 states have internal predecessors, (5754), 0 states have call successors, (0), 0 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-08 00:16:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 5754 transitions. [2025-02-08 00:16:39,542 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 5754 transitions. Word has length 167 [2025-02-08 00:16:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:39,542 INFO L471 AbstractCegarLoop]: Abstraction has 4061 states and 5754 transitions. [2025-02-08 00:16:39,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-08 00:16:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 5754 transitions. [2025-02-08 00:16:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 00:16:39,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:39,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:39,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-08 00:16:39,544 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:39,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash 235653064, now seen corresponding path program 1 times [2025-02-08 00:16:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391076175] [2025-02-08 00:16:39,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:39,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 00:16:39,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 00:16:39,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:39,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:40,071 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-08 00:16:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391076175] [2025-02-08 00:16:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391076175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:16:40,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193896656] [2025-02-08 00:16:40,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:40,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:16:40,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:40,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:16:40,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:40,072 INFO L87 Difference]: Start difference. First operand 4061 states and 5754 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-08 00:16:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:40,414 INFO L93 Difference]: Finished difference Result 8051 states and 11409 transitions. [2025-02-08 00:16:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:40,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-02-08 00:16:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:40,417 INFO L225 Difference]: With dead ends: 8051 [2025-02-08 00:16:40,417 INFO L226 Difference]: Without dead ends: 4113 [2025-02-08 00:16:40,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:40,419 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 944 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:40,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 2605 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2025-02-08 00:16:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 4113. [2025-02-08 00:16:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4113 states, 4112 states have (on average 1.413910505836576) internal successors, (5814), 4112 states have internal predecessors, (5814), 0 states have call successors, (0), 0 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-08 00:16:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 5814 transitions. [2025-02-08 00:16:40,439 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 5814 transitions. Word has length 168 [2025-02-08 00:16:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:40,440 INFO L471 AbstractCegarLoop]: Abstraction has 4113 states and 5814 transitions. [2025-02-08 00:16:40,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-08 00:16:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 5814 transitions. [2025-02-08 00:16:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 00:16:40,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:40,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:40,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-08 00:16:40,441 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:40,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1150508609, now seen corresponding path program 1 times [2025-02-08 00:16:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:40,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443963663] [2025-02-08 00:16:40,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:40,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 00:16:40,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 00:16:40,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:40,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:43,192 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-08 00:16:43,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:43,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443963663] [2025-02-08 00:16:43,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443963663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:43,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:43,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2025-02-08 00:16:43,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137847512] [2025-02-08 00:16:43,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:43,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 00:16:43,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:43,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 00:16:43,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1599, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 00:16:43,194 INFO L87 Difference]: Start difference. First operand 4113 states and 5814 transitions. Second operand has 42 states, 42 states have (on average 4.0) internal successors, (168), 41 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-08 00:16:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:48,712 INFO L93 Difference]: Finished difference Result 8428 states and 11911 transitions. [2025-02-08 00:16:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-08 00:16:48,712 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 41 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-02-08 00:16:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:48,715 INFO L225 Difference]: With dead ends: 8428 [2025-02-08 00:16:48,715 INFO L226 Difference]: Without dead ends: 4438 [2025-02-08 00:16:48,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=291, Invalid=5259, Unknown=0, NotChecked=0, Total=5550 [2025-02-08 00:16:48,717 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 1897 mSDsluCounter, 30876 mSDsCounter, 0 mSdLazyCounter, 10510 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 31688 SdHoareTripleChecker+Invalid, 10537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 10510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:48,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 31688 Invalid, 10537 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 10510 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-08 00:16:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2025-02-08 00:16:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 4422. [2025-02-08 00:16:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4422 states, 4421 states have (on average 1.413933499208324) internal successors, (6251), 4421 states have internal predecessors, (6251), 0 states have call successors, (0), 0 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-08 00:16:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 6251 transitions. [2025-02-08 00:16:48,739 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 6251 transitions. Word has length 168 [2025-02-08 00:16:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:48,739 INFO L471 AbstractCegarLoop]: Abstraction has 4422 states and 6251 transitions. [2025-02-08 00:16:48,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 41 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-08 00:16:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 6251 transitions. [2025-02-08 00:16:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 00:16:48,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:48,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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:48,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-08 00:16:48,741 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:48,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:48,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1793466423, now seen corresponding path program 1 times [2025-02-08 00:16:48,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:48,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467241340] [2025-02-08 00:16:48,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:48,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 00:16:48,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 00:16:48,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:48,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:49,426 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-08 00:16:49,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:49,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467241340] [2025-02-08 00:16:49,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467241340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:49,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:49,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:16:49,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839266620] [2025-02-08 00:16:49,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:49,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:16:49,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:49,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:16:49,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:16:49,427 INFO L87 Difference]: Start difference. First operand 4422 states and 6251 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-08 00:16:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:49,872 INFO L93 Difference]: Finished difference Result 8795 states and 12432 transitions. [2025-02-08 00:16:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:16:49,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-02-08 00:16:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:49,875 INFO L225 Difference]: With dead ends: 8795 [2025-02-08 00:16:49,875 INFO L226 Difference]: Without dead ends: 4446 [2025-02-08 00:16:49,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:16:49,878 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 1050 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 4432 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:49,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 4432 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2025-02-08 00:16:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 4439. [2025-02-08 00:16:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4438 states have (on average 1.412798557908968) internal successors, (6270), 4438 states have internal predecessors, (6270), 0 states have call successors, (0), 0 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-08 00:16:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 6270 transitions. [2025-02-08 00:16:49,928 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 6270 transitions. Word has length 169 [2025-02-08 00:16:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:49,928 INFO L471 AbstractCegarLoop]: Abstraction has 4439 states and 6270 transitions. [2025-02-08 00:16:49,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-08 00:16:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 6270 transitions. [2025-02-08 00:16:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-08 00:16:49,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:49,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:49,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-08 00:16:49,930 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:49,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:49,931 INFO L85 PathProgramCache]: Analyzing trace with hash -994869182, now seen corresponding path program 1 times [2025-02-08 00:16:49,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:49,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534618762] [2025-02-08 00:16:49,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:49,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:49,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 00:16:50,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 00:16:50,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:50,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:16:50,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:16:50,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 00:16:50,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 00:16:50,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:50,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:16:50,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:16:50,340 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:16:50,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:16:50,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-08 00:16:50,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:50,426 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:16:50,450 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:16:50,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:16:50 BoogieIcfgContainer [2025-02-08 00:16:50,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:16:50,453 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:16:50,454 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:16:50,454 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:16:50,454 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:34" (3/4) ... [2025-02-08 00:16:50,456 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:16:50,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:16:50,457 INFO L158 Benchmark]: Toolchain (without parser) took 79816.86ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 109.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 349.7MB. Max. memory is 16.1GB. [2025-02-08 00:16:50,457 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:16:50,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.30ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 57.5MB in the end (delta: 51.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 00:16:50,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 219.60ms. Allocated memory is still 142.6MB. Free memory was 57.5MB in the beginning and 53.6MB in the end (delta: 3.9MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2025-02-08 00:16:50,458 INFO L158 Benchmark]: Boogie Preprocessor took 297.47ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 53.6MB in the beginning and 72.4MB in the end (delta: -18.8MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2025-02-08 00:16:50,458 INFO L158 Benchmark]: IcfgBuilder took 2479.37ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 72.4MB in the beginning and 185.8MB in the end (delta: -113.4MB). Peak memory consumption was 189.9MB. Max. memory is 16.1GB. [2025-02-08 00:16:50,458 INFO L158 Benchmark]: TraceAbstraction took 76316.12ms. Allocated memory was 310.4MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 185.8MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 246.7MB. Max. memory is 16.1GB. [2025-02-08 00:16:50,458 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 224.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:16:50,459 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.28ms. Allocated memory is still 201.3MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.30ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 57.5MB in the end (delta: 51.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 219.60ms. Allocated memory is still 142.6MB. Free memory was 57.5MB in the beginning and 53.6MB in the end (delta: 3.9MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 297.47ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 53.6MB in the beginning and 72.4MB in the end (delta: -18.8MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * IcfgBuilder took 2479.37ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 72.4MB in the beginning and 185.8MB in the end (delta: -113.4MB). Peak memory consumption was 189.9MB. Max. memory is 16.1GB. * TraceAbstraction took 76316.12ms. Allocated memory was 310.4MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 185.8MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 246.7MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 224.3kB). 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 423, overapproximation of bitwiseAnd at line 232, overapproximation of bitwiseAnd at line 428, overapproximation of bitwiseAnd at line 261, overapproximation of bitwiseAnd at line 402, overapproximation of bitwiseAnd at line 308, overapproximation of bitwiseAnd at line 355. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_24 mask_SORT_24 = (SORT_24)-1 >> (sizeof(SORT_24) * 8 - 2); [L39] const SORT_24 msb_SORT_24 = (SORT_24)1 << (2 - 1); [L41] const SORT_181 mask_SORT_181 = (SORT_181)-1 >> (sizeof(SORT_181) * 8 - 4); [L42] const SORT_181 msb_SORT_181 = (SORT_181)1 << (4 - 1); [L44] const SORT_229 mask_SORT_229 = (SORT_229)-1 >> (sizeof(SORT_229) * 8 - 32); [L45] const SORT_229 msb_SORT_229 = (SORT_229)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_10 var_12 = 3; [L49] const SORT_10 var_15 = 2; [L50] const SORT_10 var_18 = 0; [L51] const SORT_1 var_22 = 1; [L52] const SORT_24 var_26 = 0; [L53] const SORT_24 var_29 = 3; [L54] const SORT_3 var_34 = 0; [L55] const SORT_1 var_50 = 0; [L56] const SORT_10 var_146 = 1; [L57] const SORT_10 var_151 = 4; [L58] const SORT_10 var_153 = 5; [L59] const SORT_10 var_197 = 7; [L60] const SORT_10 var_202 = 6; [L61] const SORT_229 var_231 = 0; [L62] const SORT_3 var_246 = 2; [L63] const SORT_3 var_268 = 31; [L65] SORT_1 input_2; [L66] SORT_3 input_4; [L67] SORT_5 input_6; [L68] SORT_3 input_257; [L69] SORT_3 input_258; [L70] SORT_3 input_259; [L71] SORT_3 input_267; [L72] SORT_3 input_277; [L73] SORT_3 input_278; [L74] SORT_3 input_279; [L75] SORT_3 input_282; [L76] SORT_3 input_301; [L77] SORT_3 input_302; [L78] SORT_3 input_303; [L79] SORT_3 input_306; [L80] SORT_3 input_308; [L81] SORT_24 input_322; [L82] SORT_24 input_323; [L83] SORT_24 input_324; [L85] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L85] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L86] SORT_10 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L87] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L89] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L90] SORT_1 state_127 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L91] SORT_3 state_129 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L92] SORT_3 state_131 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L93] SORT_3 state_133 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L94] SORT_3 state_135 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L95] SORT_3 state_137 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L96] SORT_3 state_139 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L97] SORT_3 state_141 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L99] SORT_5 init_9_arg_1 = var_7; [L100] state_8 = init_9_arg_1 [L101] SORT_10 init_20_arg_1 = var_18; [L102] state_19 = init_20_arg_1 [L103] SORT_3 init_36_arg_1 = var_34; [L104] state_35 = init_36_arg_1 [L105] SORT_3 init_40_arg_1 = var_34; [L106] state_39 = init_40_arg_1 [L107] SORT_3 init_46_arg_1 = var_34; [L108] state_45 = init_46_arg_1 [L109] SORT_1 init_128_arg_1 = var_50; [L110] state_127 = init_128_arg_1 [L111] SORT_3 init_130_arg_1 = var_34; [L112] state_129 = init_130_arg_1 [L113] SORT_3 init_132_arg_1 = var_34; [L114] state_131 = init_132_arg_1 [L115] SORT_3 init_134_arg_1 = var_34; [L116] state_133 = init_134_arg_1 [L117] SORT_3 init_136_arg_1 = var_34; [L118] state_135 = init_136_arg_1 [L119] SORT_3 init_138_arg_1 = var_34; [L120] state_137 = init_138_arg_1 [L121] SORT_3 init_140_arg_1 = var_34; [L122] state_139 = init_140_arg_1 [L123] SORT_3 init_142_arg_1 = var_34; [L124] state_141 = init_142_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L127] input_2 = __VERIFIER_nondet_uchar() [L128] input_4 = __VERIFIER_nondet_uchar() [L129] input_6 = __VERIFIER_nondet_ushort() [L130] input_257 = __VERIFIER_nondet_uchar() [L131] input_258 = __VERIFIER_nondet_uchar() [L132] input_259 = __VERIFIER_nondet_uchar() [L133] input_267 = __VERIFIER_nondet_uchar() [L134] input_277 = __VERIFIER_nondet_uchar() [L135] input_278 = __VERIFIER_nondet_uchar() [L136] input_279 = __VERIFIER_nondet_uchar() [L137] input_282 = __VERIFIER_nondet_uchar() [L138] input_301 = __VERIFIER_nondet_uchar() [L139] input_302 = __VERIFIER_nondet_uchar() [L140] input_303 = __VERIFIER_nondet_uchar() [L141] input_306 = __VERIFIER_nondet_uchar() [L142] input_308 = __VERIFIER_nondet_uchar() [L143] input_322 = __VERIFIER_nondet_uchar() [L144] input_323 = __VERIFIER_nondet_uchar() [L145] input_324 = __VERIFIER_nondet_uchar() [L148] SORT_5 var_11_arg_0 = state_8; [L149] SORT_10 var_11 = var_11_arg_0 >> 9; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L150] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L150] var_11 = var_11 & mask_SORT_10 [L151] SORT_10 var_13_arg_0 = var_11; [L152] SORT_10 var_13_arg_1 = var_12; [L153] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L154] SORT_5 var_14_arg_0 = state_8; [L155] SORT_10 var_14 = var_14_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L156] EXPR var_14 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L156] var_14 = var_14 & mask_SORT_10 [L157] SORT_10 var_16_arg_0 = var_14; [L158] SORT_10 var_16_arg_1 = var_15; [L159] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L160] SORT_1 var_17_arg_0 = var_13; [L161] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17_arg_0=0, var_17_arg_1=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L162] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L162] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L163] SORT_10 var_21_arg_0 = state_19; [L164] SORT_1 var_21 = var_21_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_21=0, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L165] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L165] var_21 = var_21 & mask_SORT_1 [L166] SORT_1 var_23_arg_0 = var_21; [L167] SORT_1 var_23_arg_1 = var_22; [L168] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L169] SORT_10 var_25_arg_0 = state_19; [L170] SORT_24 var_25 = var_25_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_23=0, var_246=2, var_25=0, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L171] EXPR var_25 & mask_SORT_24 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_23=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L171] var_25 = var_25 & mask_SORT_24 [L172] SORT_24 var_27_arg_0 = var_25; [L173] SORT_24 var_27_arg_1 = var_26; [L174] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L175] SORT_1 var_28_arg_0 = var_23; [L176] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_25=0, var_268=31, var_26=0, var_28_arg_0=0, var_28_arg_1=1, var_29=3, var_34=0, var_50=0] [L177] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_25=0, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L177] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L178] SORT_24 var_30_arg_0 = var_25; [L179] SORT_24 var_30_arg_1 = var_29; [L180] SORT_1 var_30 = var_30_arg_0 == var_30_arg_1; [L181] SORT_1 var_31_arg_0 = var_28; [L182] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_31_arg_0=1, var_31_arg_1=0, var_34=0, var_50=0] [L183] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L183] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L184] SORT_1 var_32_arg_0 = var_17; [L185] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_32_arg_0=0, var_32_arg_1=1, var_34=0, var_50=0] [L186] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L186] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L187] SORT_1 var_33_arg_0 = var_32; [L188] SORT_1 var_33 = ~var_33_arg_0; [L189] SORT_3 var_37_arg_0 = state_35; [L190] SORT_1 var_37 = var_37_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_50=0] [L191] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L191] var_37 = var_37 & mask_SORT_1 [L192] SORT_1 var_38_arg_0 = var_37; [L193] SORT_1 var_38_arg_1 = var_22; [L194] SORT_1 var_38 = var_38_arg_0 == var_38_arg_1; [L195] SORT_3 var_41_arg_0 = state_39; [L196] SORT_1 var_41 = var_41_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_38=0, var_41=0, var_50=0] [L197] EXPR var_41 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_38=0, var_50=0] [L197] var_41 = var_41 & mask_SORT_1 [L198] SORT_1 var_42_arg_0 = var_41; [L199] SORT_1 var_42_arg_1 = var_22; [L200] SORT_1 var_42 = var_42_arg_0 == var_42_arg_1; [L201] SORT_1 var_43_arg_0 = var_38; [L202] SORT_1 var_43_arg_1 = var_42; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_43_arg_0=0, var_43_arg_1=0, var_50=0] [L203] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_50=0] [L203] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L204] SORT_1 var_44_arg_0 = var_43; [L205] SORT_1 var_44 = ~var_44_arg_0; [L206] SORT_3 var_47_arg_0 = state_45; [L207] SORT_1 var_47 = var_47_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_44=-1, var_47=0, var_50=0] [L208] EXPR var_47 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_44=-1, var_50=0] [L208] var_47 = var_47 & mask_SORT_1 [L209] SORT_1 var_48_arg_0 = var_47; [L210] SORT_1 var_48_arg_1 = var_22; [L211] SORT_1 var_48 = var_48_arg_0 == var_48_arg_1; [L212] SORT_1 var_49_arg_0 = var_44; [L213] SORT_1 var_49_arg_1 = var_48; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_47=0, var_49_arg_0=-1, var_49_arg_1=0, var_50=0] [L214] EXPR var_49_arg_0 | var_49_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_47=0, var_50=0] [L214] SORT_1 var_49 = var_49_arg_0 | var_49_arg_1; [L215] SORT_1 var_51_arg_0 = var_47; [L216] SORT_1 var_51_arg_1 = var_50; [L217] SORT_1 var_51 = var_51_arg_0 == var_51_arg_1; [L218] SORT_1 var_52_arg_0 = var_37; [L219] SORT_1 var_52_arg_1 = var_22; [L220] SORT_1 var_52 = var_52_arg_0 == var_52_arg_1; [L221] SORT_1 var_53_arg_0 = var_41; [L222] SORT_1 var_53_arg_1 = var_22; [L223] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L224] SORT_1 var_54_arg_0 = var_52; [L225] SORT_1 var_54_arg_1 = var_53; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0, var_51=1, var_54_arg_0=0, var_54_arg_1=0] [L226] EXPR var_54_arg_0 & var_54_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0, var_51=1] [L226] SORT_1 var_54 = var_54_arg_0 & var_54_arg_1; [L227] SORT_1 var_55_arg_0 = var_51; [L228] SORT_1 var_55_arg_1 = var_54; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0, var_55_arg_0=1, var_55_arg_1=0] [L229] EXPR var_55_arg_0 | var_55_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0] [L229] SORT_1 var_55 = var_55_arg_0 | var_55_arg_1; [L230] SORT_1 var_56_arg_0 = var_49; [L231] SORT_1 var_56_arg_1 = var_55; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56_arg_0=255, var_56_arg_1=1] [L232] EXPR var_56_arg_0 & var_56_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L232] SORT_1 var_56 = var_56_arg_0 & var_56_arg_1; [L233] SORT_3 var_57_arg_0 = state_35; [L234] SORT_1 var_57 = var_57_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0] [L235] EXPR var_57 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1] [L235] var_57 = var_57 & mask_SORT_1 [L236] SORT_1 var_58_arg_0 = var_57; [L237] SORT_1 var_58_arg_1 = var_22; [L238] SORT_1 var_58 = var_58_arg_0 == var_58_arg_1; [L239] SORT_3 var_59_arg_0 = state_39; [L240] SORT_1 var_59 = var_59_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_58=0, var_59=0] [L241] EXPR var_59 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_58=0] [L241] var_59 = var_59 & mask_SORT_1 [L242] SORT_1 var_60_arg_0 = var_59; [L243] SORT_1 var_60_arg_1 = var_22; [L244] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L245] SORT_1 var_61_arg_0 = var_58; [L246] SORT_1 var_61_arg_1 = var_60; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_61_arg_0=0, var_61_arg_1=0] [L247] EXPR var_61_arg_0 & var_61_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0] [L247] SORT_1 var_61 = var_61_arg_0 & var_61_arg_1; [L248] SORT_1 var_62_arg_0 = var_61; [L249] SORT_1 var_62 = ~var_62_arg_0; [L250] SORT_3 var_63_arg_0 = state_45; [L251] SORT_1 var_63 = var_63_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_62=-1, var_63=0] [L252] EXPR var_63 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_62=-1] [L252] var_63 = var_63 & mask_SORT_1 [L253] SORT_1 var_64_arg_0 = var_63; [L254] SORT_1 var_64_arg_1 = var_22; [L255] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L256] SORT_1 var_65_arg_0 = var_62; [L257] SORT_1 var_65_arg_1 = var_64; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_63=0, var_65_arg_0=-1, var_65_arg_1=0] [L258] EXPR var_65_arg_0 | var_65_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_63=0] [L258] SORT_1 var_65 = var_65_arg_0 | var_65_arg_1; [L259] SORT_1 var_66_arg_0 = var_56; [L260] SORT_1 var_66_arg_1 = var_65; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_57=0, var_59=0, var_63=0, var_66_arg_0=1, var_66_arg_1=255] [L261] EXPR var_66_arg_0 & var_66_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_57=0, var_59=0, var_63=0] [L261] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L262] SORT_1 var_67_arg_0 = var_63; [L263] SORT_1 var_67_arg_1 = var_50; [L264] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L265] SORT_1 var_68_arg_0 = var_57; [L266] SORT_1 var_68_arg_1 = var_22; [L267] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L268] SORT_1 var_69_arg_0 = var_59; [L269] SORT_1 var_69_arg_1 = var_22; [L270] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L271] SORT_1 var_70_arg_0 = var_68; [L272] SORT_1 var_70_arg_1 = var_69; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1, var_67=1, var_70_arg_0=0, var_70_arg_1=0] [L273] EXPR var_70_arg_0 & var_70_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1, var_67=1] [L273] SORT_1 var_70 = var_70_arg_0 & var_70_arg_1; [L274] SORT_1 var_71_arg_0 = var_67; [L275] SORT_1 var_71_arg_1 = var_70; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1, var_71_arg_0=1, var_71_arg_1=0] [L276] EXPR var_71_arg_0 | var_71_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1] [L276] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L277] SORT_1 var_72_arg_0 = var_66; [L278] SORT_1 var_72_arg_1 = var_71; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72_arg_0=1, var_72_arg_1=1] [L279] EXPR var_72_arg_0 & var_72_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L279] SORT_1 var_72 = var_72_arg_0 & var_72_arg_1; [L280] SORT_3 var_73_arg_0 = state_35; [L281] SORT_1 var_73 = var_73_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0] [L282] EXPR var_73 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1] [L282] var_73 = var_73 & mask_SORT_1 [L283] SORT_1 var_74_arg_0 = var_73; [L284] SORT_1 var_74_arg_1 = var_22; [L285] SORT_1 var_74 = var_74_arg_0 == var_74_arg_1; [L286] SORT_3 var_75_arg_0 = state_39; [L287] SORT_1 var_75 = var_75_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_74=0, var_75=0] [L288] EXPR var_75 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_74=0] [L288] var_75 = var_75 & mask_SORT_1 [L289] SORT_1 var_76_arg_0 = var_75; [L290] SORT_1 var_76_arg_1 = var_22; [L291] SORT_1 var_76 = var_76_arg_0 == var_76_arg_1; [L292] SORT_1 var_77_arg_0 = var_74; [L293] SORT_1 var_77_arg_1 = var_76; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_77_arg_0=0, var_77_arg_1=0] [L294] EXPR var_77_arg_0 & var_77_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0] [L294] SORT_1 var_77 = var_77_arg_0 & var_77_arg_1; [L295] SORT_1 var_78_arg_0 = var_77; [L296] SORT_1 var_78 = ~var_78_arg_0; [L297] SORT_3 var_79_arg_0 = state_45; [L298] SORT_1 var_79 = var_79_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_78=-1, var_79=0] [L299] EXPR var_79 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_78=-1] [L299] var_79 = var_79 & mask_SORT_1 [L300] SORT_1 var_80_arg_0 = var_79; [L301] SORT_1 var_80_arg_1 = var_22; [L302] SORT_1 var_80 = var_80_arg_0 == var_80_arg_1; [L303] SORT_1 var_81_arg_0 = var_78; [L304] SORT_1 var_81_arg_1 = var_80; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_79=0, var_81_arg_0=-1, var_81_arg_1=0] [L305] EXPR var_81_arg_0 | var_81_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_79=0] [L305] SORT_1 var_81 = var_81_arg_0 | var_81_arg_1; [L306] SORT_1 var_82_arg_0 = var_72; [L307] SORT_1 var_82_arg_1 = var_81; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_73=0, var_75=0, var_79=0, var_82_arg_0=1, var_82_arg_1=255] [L308] EXPR var_82_arg_0 & var_82_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_73=0, var_75=0, var_79=0] [L308] SORT_1 var_82 = var_82_arg_0 & var_82_arg_1; [L309] SORT_1 var_83_arg_0 = var_79; [L310] SORT_1 var_83_arg_1 = var_50; [L311] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L312] SORT_1 var_84_arg_0 = var_73; [L313] SORT_1 var_84_arg_1 = var_22; [L314] SORT_1 var_84 = var_84_arg_0 == var_84_arg_1; [L315] SORT_1 var_85_arg_0 = var_75; [L316] SORT_1 var_85_arg_1 = var_22; [L317] SORT_1 var_85 = var_85_arg_0 == var_85_arg_1; [L318] SORT_1 var_86_arg_0 = var_84; [L319] SORT_1 var_86_arg_1 = var_85; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1, var_83=1, var_86_arg_0=0, var_86_arg_1=0] [L320] EXPR var_86_arg_0 & var_86_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1, var_83=1] [L320] SORT_1 var_86 = var_86_arg_0 & var_86_arg_1; [L321] SORT_1 var_87_arg_0 = var_83; [L322] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1, var_87_arg_0=1, var_87_arg_1=0] [L323] EXPR var_87_arg_0 | var_87_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1] [L323] SORT_1 var_87 = var_87_arg_0 | var_87_arg_1; [L324] SORT_1 var_88_arg_0 = var_82; [L325] SORT_1 var_88_arg_1 = var_87; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88_arg_0=1, var_88_arg_1=1] [L326] EXPR var_88_arg_0 & var_88_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L326] SORT_1 var_88 = var_88_arg_0 & var_88_arg_1; [L327] SORT_3 var_89_arg_0 = state_35; [L328] SORT_1 var_89 = var_89_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0] [L329] EXPR var_89 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1] [L329] var_89 = var_89 & mask_SORT_1 [L330] SORT_1 var_90_arg_0 = var_89; [L331] SORT_1 var_90_arg_1 = var_22; [L332] SORT_1 var_90 = var_90_arg_0 == var_90_arg_1; [L333] SORT_3 var_91_arg_0 = state_39; [L334] SORT_1 var_91 = var_91_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_90=0, var_91=0] [L335] EXPR var_91 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_90=0] [L335] var_91 = var_91 & mask_SORT_1 [L336] SORT_1 var_92_arg_0 = var_91; [L337] SORT_1 var_92_arg_1 = var_22; [L338] SORT_1 var_92 = var_92_arg_0 == var_92_arg_1; [L339] SORT_1 var_93_arg_0 = var_90; [L340] SORT_1 var_93_arg_1 = var_92; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_93_arg_0=0, var_93_arg_1=0] [L341] EXPR var_93_arg_0 & var_93_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0] [L341] SORT_1 var_93 = var_93_arg_0 & var_93_arg_1; [L342] SORT_1 var_94_arg_0 = var_93; [L343] SORT_1 var_94 = ~var_94_arg_0; [L344] SORT_3 var_95_arg_0 = state_45; [L345] SORT_1 var_95 = var_95_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_94=-1, var_95=0] [L346] EXPR var_95 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_94=-1] [L346] var_95 = var_95 & mask_SORT_1 [L347] SORT_1 var_96_arg_0 = var_95; [L348] SORT_1 var_96_arg_1 = var_22; [L349] SORT_1 var_96 = var_96_arg_0 == var_96_arg_1; [L350] SORT_1 var_97_arg_0 = var_94; [L351] SORT_1 var_97_arg_1 = var_96; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_95=0, var_97_arg_0=-1, var_97_arg_1=0] [L352] EXPR var_97_arg_0 | var_97_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_95=0] [L352] SORT_1 var_97 = var_97_arg_0 | var_97_arg_1; [L353] SORT_1 var_98_arg_0 = var_88; [L354] SORT_1 var_98_arg_1 = var_97; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_89=0, var_91=0, var_95=0, var_98_arg_0=1, var_98_arg_1=255] [L355] EXPR var_98_arg_0 & var_98_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_89=0, var_91=0, var_95=0] [L355] SORT_1 var_98 = var_98_arg_0 & var_98_arg_1; [L356] SORT_1 var_99_arg_0 = var_95; [L357] SORT_1 var_99_arg_1 = var_50; [L358] SORT_1 var_99 = var_99_arg_0 == var_99_arg_1; [L359] SORT_1 var_100_arg_0 = var_89; [L360] SORT_1 var_100_arg_1 = var_22; [L361] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L362] SORT_1 var_101_arg_0 = var_91; [L363] SORT_1 var_101_arg_1 = var_22; [L364] SORT_1 var_101 = var_101_arg_0 == var_101_arg_1; [L365] SORT_1 var_102_arg_0 = var_100; [L366] SORT_1 var_102_arg_1 = var_101; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_102_arg_0=0, var_102_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1, var_99=1] [L367] EXPR var_102_arg_0 & var_102_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1, var_99=1] [L367] SORT_1 var_102 = var_102_arg_0 & var_102_arg_1; [L368] SORT_1 var_103_arg_0 = var_99; [L369] SORT_1 var_103_arg_1 = var_102; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_103_arg_0=1, var_103_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1] [L370] EXPR var_103_arg_0 | var_103_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1] [L370] SORT_1 var_103 = var_103_arg_0 | var_103_arg_1; [L371] SORT_1 var_104_arg_0 = var_98; [L372] SORT_1 var_104_arg_1 = var_103; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104_arg_0=1, var_104_arg_1=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L373] EXPR var_104_arg_0 & var_104_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L373] SORT_1 var_104 = var_104_arg_0 & var_104_arg_1; [L374] SORT_3 var_105_arg_0 = state_35; [L375] SORT_1 var_105 = var_105_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L376] EXPR var_105 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L376] var_105 = var_105 & mask_SORT_1 [L377] SORT_1 var_106_arg_0 = var_105; [L378] SORT_1 var_106_arg_1 = var_22; [L379] SORT_1 var_106 = var_106_arg_0 == var_106_arg_1; [L380] SORT_3 var_107_arg_0 = state_39; [L381] SORT_1 var_107 = var_107_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_106=0, var_107=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L382] EXPR var_107 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_106=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L382] var_107 = var_107 & mask_SORT_1 [L383] SORT_1 var_108_arg_0 = var_107; [L384] SORT_1 var_108_arg_1 = var_22; [L385] SORT_1 var_108 = var_108_arg_0 == var_108_arg_1; [L386] SORT_1 var_109_arg_0 = var_106; [L387] SORT_1 var_109_arg_1 = var_108; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_109_arg_0=0, var_109_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L388] EXPR var_109_arg_0 & var_109_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L388] SORT_1 var_109 = var_109_arg_0 & var_109_arg_1; [L389] SORT_1 var_110_arg_0 = var_109; [L390] SORT_1 var_110 = ~var_110_arg_0; [L391] SORT_3 var_111_arg_0 = state_45; [L392] SORT_1 var_111 = var_111_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_110=-1, var_111=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L393] EXPR var_111 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_110=-1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L393] var_111 = var_111 & mask_SORT_1 [L394] SORT_1 var_112_arg_0 = var_111; [L395] SORT_1 var_112_arg_1 = var_22; [L396] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L397] SORT_1 var_113_arg_0 = var_110; [L398] SORT_1 var_113_arg_1 = var_112; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_111=0, var_113_arg_0=-1, var_113_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L399] EXPR var_113_arg_0 | var_113_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_111=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L399] SORT_1 var_113 = var_113_arg_0 | var_113_arg_1; [L400] SORT_1 var_114_arg_0 = var_104; [L401] SORT_1 var_114_arg_1 = var_113; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_105=0, var_107=0, var_111=0, var_114_arg_0=1, var_114_arg_1=255, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L402] EXPR var_114_arg_0 & var_114_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_105=0, var_107=0, var_111=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L402] SORT_1 var_114 = var_114_arg_0 & var_114_arg_1; [L403] SORT_1 var_115_arg_0 = var_111; [L404] SORT_1 var_115_arg_1 = var_50; [L405] SORT_1 var_115 = var_115_arg_0 == var_115_arg_1; [L406] SORT_1 var_116_arg_0 = var_105; [L407] SORT_1 var_116_arg_1 = var_22; [L408] SORT_1 var_116 = var_116_arg_0 == var_116_arg_1; [L409] SORT_1 var_117_arg_0 = var_107; [L410] SORT_1 var_117_arg_1 = var_22; [L411] SORT_1 var_117 = var_117_arg_0 == var_117_arg_1; [L412] SORT_1 var_118_arg_0 = var_116; [L413] SORT_1 var_118_arg_1 = var_117; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_115=1, var_118_arg_0=0, var_118_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L414] EXPR var_118_arg_0 & var_118_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_115=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L414] SORT_1 var_118 = var_118_arg_0 & var_118_arg_1; [L415] SORT_1 var_119_arg_0 = var_115; [L416] SORT_1 var_119_arg_1 = var_118; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_119_arg_0=1, var_119_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L417] EXPR var_119_arg_0 | var_119_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L417] SORT_1 var_119 = var_119_arg_0 | var_119_arg_1; [L418] SORT_1 var_120_arg_0 = var_114; [L419] SORT_1 var_120_arg_1 = var_119; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_120_arg_0=1, var_120_arg_1=1, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L420] EXPR var_120_arg_0 & var_120_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L420] SORT_1 var_120 = var_120_arg_0 & var_120_arg_1; [L421] SORT_1 var_121_arg_0 = var_33; [L422] SORT_1 var_121_arg_1 = var_120; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_121_arg_0=-1, var_121_arg_1=1, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L423] EXPR var_121_arg_0 | var_121_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L423] SORT_1 var_121 = var_121_arg_0 | var_121_arg_1; [L424] SORT_1 var_124_arg_0 = var_121; [L425] SORT_1 var_124 = ~var_124_arg_0; [L426] SORT_1 var_125_arg_0 = var_22; [L427] SORT_1 var_125_arg_1 = var_124; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_125_arg_0=1, var_125_arg_1=-1, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L428] EXPR var_125_arg_0 & var_125_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L428] SORT_1 var_125 = var_125_arg_0 & var_125_arg_1; [L429] EXPR var_125 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L429] var_125 = var_125 & mask_SORT_1 [L430] SORT_1 bad_126_arg_0 = var_125; [L431] CALL __VERIFIER_assert(!(bad_126_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 721 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.2s, OverallIterations: 62, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 41.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33705 SdHoareTripleChecker+Valid, 37.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33705 mSDsluCounter, 389652 SdHoareTripleChecker+Invalid, 32.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 335567 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95710 IncrementalHoareTripleChecker+Invalid, 95806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 54085 mSDtfsCounter, 95710 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 133 SyntacticMatches, 9 SemanticMatches, 518 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4439occurred in iteration=61, InterpolantAutomatonStates: 522, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 61 MinimizatonAttempts, 7373 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 9797 NumberOfCodeBlocks, 9797 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 9566 ConstructedInterpolants, 0 QuantifiedInterpolants, 22833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 61 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-08 00:16:50,488 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.vis_arrays_vsaR_p09.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:16:52,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:16:52,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:16:52,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:16:52,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:16:52,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:16:52,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:16:52,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:16:52,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:16:52,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:16:52,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:16:52,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:16:52,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:16:52,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:16:52,847 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:16:52,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:16:52,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:16:52,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:16:52,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:16:52,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:16:52,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:16:52,848 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:16:52,848 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:16:52,848 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:16:52,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:16:52,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:16:52,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:16:52,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:16:52,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:16:52,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:16:52,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:16:52,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:16:52,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:16:52,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:16:52,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:16:52,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:16:52,850 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:16:52,850 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:16:52,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:16:52,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:16:52,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:16:52,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:16:52,850 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 -> 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 [2025-02-08 00:16:53,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:16:53,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:16:53,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:16:53,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:16:53,119 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:16:53,119 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.vis_arrays_vsaR_p09.c