./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-08 09:43:43,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:43:43,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:43:43,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:43:43,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:43:43,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:43:43,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:43:43,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:43:43,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:43:43,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:43:43,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:43:43,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:43:43,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:43:43,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:43:43,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:43:43,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:43:43,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:43:43,711 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/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-03-08 09:43:43,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:43:43,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:43:43,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:43:43,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:43:43,917 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:43:43,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-08 09:43:44,977 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7335bbc9/9e0d7232b0294fbea4c73addd837284e/FLAGdd5ce61dd [2025-03-08 09:43:45,223 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:43:45,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-08 09:43:45,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7335bbc9/9e0d7232b0294fbea4c73addd837284e/FLAGdd5ce61dd [2025-03-08 09:43:45,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7335bbc9/9e0d7232b0294fbea4c73addd837284e [2025-03-08 09:43:45,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:43:45,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:43:45,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:43:45,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:43:45,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:43:45,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:43:45" (1/1) ... [2025-03-08 09:43:45,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fdd496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:45, skipping insertion in model container [2025-03-08 09:43:45,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:43:45" (1/1) ... [2025-03-08 09:43:45,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:43:45,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c[1259,1272] [2025-03-08 09:43:45,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:43:45,940 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:43:45,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c[1259,1272] [2025-03-08 09:43:46,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:43:46,033 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:43:46,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46 WrapperNode [2025-03-08 09:43:46,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:43:46,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:43:46,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:43:46,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:43:46,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,270 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2751 [2025-03-08 09:43:46,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:43:46,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:43:46,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:43:46,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:43:46,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,409 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-03-08 09:43:46,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:43:46,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:43:46,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:43:46,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:43:46,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (1/1) ... [2025-03-08 09:43:46,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:43:46,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:43:46,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:43:46,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:43:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:43:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:43:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:43:46,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:43:46,798 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:43:46,799 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:43:48,811 INFO L? ?]: Removed 1738 outVars from TransFormulas that were not future-live. [2025-03-08 09:43:48,811 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:43:48,888 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:43:48,888 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:43:48,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:43:48 BoogieIcfgContainer [2025-03-08 09:43:48,888 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:43:48,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:43:48,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:43:48,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:43:48,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:43:45" (1/3) ... [2025-03-08 09:43:48,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d80fe6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:43:48, skipping insertion in model container [2025-03-08 09:43:48,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:43:46" (2/3) ... [2025-03-08 09:43:48,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d80fe6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:43:48, skipping insertion in model container [2025-03-08 09:43:48,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:43:48" (3/3) ... [2025-03-08 09:43:48,899 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-08 09:43:48,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:43:48,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p09.c that has 1 procedures, 723 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:43:48,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:43:48,985 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;@762d0309, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:43:48,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:43:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 723 states, 721 states have (on average 1.4993065187239945) internal successors, (1081), 722 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:43:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 09:43:49,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:49,006 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-03-08 09:43:49,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:49,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 638021794, now seen corresponding path program 1 times [2025-03-08 09:43:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:49,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878388377] [2025-03-08 09:43:49,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:49,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:49,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 09:43:49,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 09:43:49,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:49,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:50,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-03-08 09:43:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878388377] [2025-03-08 09:43:50,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878388377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:50,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:43:50,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398265084] [2025-03-08 09:43:50,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:50,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:43:50,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:50,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:43:50,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:43:50,235 INFO L87 Difference]: Start difference. First operand has 723 states, 721 states have (on average 1.4993065187239945) internal successors, (1081), 722 states have internal predecessors, (1081), 0 states have call successors, (0), 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.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-03-08 09:43:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:50,643 INFO L93 Difference]: Finished difference Result 1391 states and 2083 transitions. [2025-03-08 09:43:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:43:50,648 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-03-08 09:43:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:50,659 INFO L225 Difference]: With dead ends: 1391 [2025-03-08 09:43:50,659 INFO L226 Difference]: Without dead ends: 722 [2025-03-08 09:43:50,663 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-03-08 09:43:50,665 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 0 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2686 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-03-08 09:43:50,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2686 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:43:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-08 09:43:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2025-03-08 09:43:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 1.4965325936199723) internal successors, (1079), 721 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-03-08 09:43:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1079 transitions. [2025-03-08 09:43:50,738 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1079 transitions. Word has length 141 [2025-03-08 09:43:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:50,738 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1079 transitions. [2025-03-08 09:43:50,739 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-03-08 09:43:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1079 transitions. [2025-03-08 09:43:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 09:43:50,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:50,740 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-03-08 09:43:50,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:43:50,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:50,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1691480949, now seen corresponding path program 1 times [2025-03-08 09:43:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:50,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782860607] [2025-03-08 09:43:50,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:50,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:50,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 09:43:50,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 09:43:50,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:50,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:51,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:51,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782860607] [2025-03-08 09:43:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782860607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:51,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:51,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:43:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932630822] [2025-03-08 09:43:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:51,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:43:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:51,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:43:51,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:43:51,156 INFO L87 Difference]: Start difference. First operand 722 states and 1079 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 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-03-08 09:43:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:51,611 INFO L93 Difference]: Finished difference Result 1392 states and 2081 transitions. [2025-03-08 09:43:51,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:43:51,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 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-03-08 09:43:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:51,617 INFO L225 Difference]: With dead ends: 1392 [2025-03-08 09:43:51,619 INFO L226 Difference]: Without dead ends: 724 [2025-03-08 09:43:51,620 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-03-08 09:43:51,621 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 0 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2683 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:43:51,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2683 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:43:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-08 09:43:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2025-03-08 09:43:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 1.4951590594744122) internal successors, (1081), 723 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:43:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1081 transitions. [2025-03-08 09:43:51,647 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1081 transitions. Word has length 142 [2025-03-08 09:43:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:51,647 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1081 transitions. [2025-03-08 09:43:51,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 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-03-08 09:43:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1081 transitions. [2025-03-08 09:43:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 09:43:51,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:51,650 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-03-08 09:43:51,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:43:51,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:51,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:51,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1035208125, now seen corresponding path program 1 times [2025-03-08 09:43:51,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:51,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132669557] [2025-03-08 09:43:51,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:51,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:51,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:43:51,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:43:51,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:51,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:52,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132669557] [2025-03-08 09:43:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132669557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:43:52,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183135085] [2025-03-08 09:43:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:52,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:43:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:52,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:43:52,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:43:52,381 INFO L87 Difference]: Start difference. First operand 724 states and 1081 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-03-08 09:43:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:52,841 INFO L93 Difference]: Finished difference Result 1402 states and 2094 transitions. [2025-03-08 09:43:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:43:52,841 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-03-08 09:43:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:52,844 INFO L225 Difference]: With dead ends: 1402 [2025-03-08 09:43:52,844 INFO L226 Difference]: Without dead ends: 732 [2025-03-08 09:43:52,845 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-03-08 09:43:52,845 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 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-03-08 09:43:52,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:43:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-08 09:43:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2025-03-08 09:43:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.4938271604938271) internal successors, (1089), 729 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:43:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1089 transitions. [2025-03-08 09:43:52,858 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1089 transitions. Word has length 143 [2025-03-08 09:43:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:52,859 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1089 transitions. [2025-03-08 09:43:52,859 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-03-08 09:43:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1089 transitions. [2025-03-08 09:43:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 09:43:52,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:52,863 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-03-08 09:43:52,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:43:52,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:52,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:52,864 INFO L85 PathProgramCache]: Analyzing trace with hash 965335480, now seen corresponding path program 1 times [2025-03-08 09:43:52,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:52,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747677241] [2025-03-08 09:43:52,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:52,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:52,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:43:53,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:43:53,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:53,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:53,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:53,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747677241] [2025-03-08 09:43:53,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747677241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:53,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:53,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:43:53,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683810511] [2025-03-08 09:43:53,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:53,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:43:53,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:53,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:43:53,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:43:53,679 INFO L87 Difference]: Start difference. First operand 730 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 28.8) 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-03-08 09:43:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:54,106 INFO L93 Difference]: Finished difference Result 1414 states and 2110 transitions. [2025-03-08 09:43:54,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:43:54,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) 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-03-08 09:43:54,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:54,109 INFO L225 Difference]: With dead ends: 1414 [2025-03-08 09:43:54,109 INFO L226 Difference]: Without dead ends: 738 [2025-03-08 09:43:54,110 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-03-08 09:43:54,114 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 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-03-08 09:43:54,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:43:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-08 09:43:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2025-03-08 09:43:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 1.4925170068027211) internal successors, (1097), 735 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:43:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1097 transitions. [2025-03-08 09:43:54,127 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1097 transitions. Word has length 144 [2025-03-08 09:43:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:54,128 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1097 transitions. [2025-03-08 09:43:54,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) 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-03-08 09:43:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1097 transitions. [2025-03-08 09:43:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 09:43:54,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:54,129 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-03-08 09:43:54,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:43:54,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:54,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1012068597, now seen corresponding path program 1 times [2025-03-08 09:43:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:54,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123613966] [2025-03-08 09:43:54,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:54,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 09:43:54,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 09:43:54,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:54,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:54,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:54,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123613966] [2025-03-08 09:43:54,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123613966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:54,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:54,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:43:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171573576] [2025-03-08 09:43:54,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:54,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:43:54,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:54,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:43:54,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:43:54,722 INFO L87 Difference]: Start difference. First operand 736 states and 1097 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-03-08 09:43:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:55,231 INFO L93 Difference]: Finished difference Result 1426 states and 2126 transitions. [2025-03-08 09:43:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:43:55,232 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-03-08 09:43:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:55,234 INFO L225 Difference]: With dead ends: 1426 [2025-03-08 09:43:55,234 INFO L226 Difference]: Without dead ends: 744 [2025-03-08 09:43:55,235 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-03-08 09:43:55,236 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:43:55,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:43:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-08 09:43:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2025-03-08 09:43:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.4912280701754386) internal successors, (1105), 741 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:43:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1105 transitions. [2025-03-08 09:43:55,250 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1105 transitions. Word has length 145 [2025-03-08 09:43:55,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:55,251 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1105 transitions. [2025-03-08 09:43:55,251 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-03-08 09:43:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1105 transitions. [2025-03-08 09:43:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 09:43:55,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:55,252 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-03-08 09:43:55,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:43:55,253 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:55,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1190201077, now seen corresponding path program 1 times [2025-03-08 09:43:55,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:55,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791191751] [2025-03-08 09:43:55,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:55,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:55,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 09:43:55,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 09:43:55,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:55,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:55,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:55,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791191751] [2025-03-08 09:43:55,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791191751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:55,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:55,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:43:55,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663925649] [2025-03-08 09:43:55,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:55,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:43:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:55,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:43:55,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:43:55,824 INFO L87 Difference]: Start difference. First operand 742 states and 1105 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-03-08 09:43:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:56,211 INFO L93 Difference]: Finished difference Result 1438 states and 2142 transitions. [2025-03-08 09:43:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:43:56,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-03-08 09:43:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:56,215 INFO L225 Difference]: With dead ends: 1438 [2025-03-08 09:43:56,215 INFO L226 Difference]: Without dead ends: 750 [2025-03-08 09:43:56,216 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-03-08 09:43:56,217 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 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-03-08 09:43:56,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:43:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-08 09:43:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2025-03-08 09:43:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 1.4899598393574298) internal successors, (1113), 747 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:43:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1113 transitions. [2025-03-08 09:43:56,230 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1113 transitions. Word has length 146 [2025-03-08 09:43:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:56,230 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1113 transitions. [2025-03-08 09:43:56,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-03-08 09:43:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1113 transitions. [2025-03-08 09:43:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 09:43:56,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:56,232 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-03-08 09:43:56,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:43:56,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:56,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1975019365, now seen corresponding path program 1 times [2025-03-08 09:43:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:56,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512852233] [2025-03-08 09:43:56,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:56,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 09:43:56,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 09:43:56,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:56,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:56,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:56,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512852233] [2025-03-08 09:43:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512852233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:43:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279017681] [2025-03-08 09:43:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:56,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:43:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:56,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:43:56,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:43:56,858 INFO L87 Difference]: Start difference. First operand 748 states and 1113 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-03-08 09:43:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:57,220 INFO L93 Difference]: Finished difference Result 1444 states and 2149 transitions. [2025-03-08 09:43:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:43:57,221 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-03-08 09:43:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:57,224 INFO L225 Difference]: With dead ends: 1444 [2025-03-08 09:43:57,224 INFO L226 Difference]: Without dead ends: 750 [2025-03-08 09:43:57,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:43:57,226 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 958 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:43:57,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 2614 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:43:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-08 09:43:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2025-03-08 09:43:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 1.4886515353805074) internal successors, (1115), 749 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:43:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1115 transitions. [2025-03-08 09:43:57,240 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1115 transitions. Word has length 147 [2025-03-08 09:43:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:57,241 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1115 transitions. [2025-03-08 09:43:57,241 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-03-08 09:43:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1115 transitions. [2025-03-08 09:43:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 09:43:57,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:57,242 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-03-08 09:43:57,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 09:43:57,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2145560741, now seen corresponding path program 1 times [2025-03-08 09:43:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:57,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840432454] [2025-03-08 09:43:57,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:57,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 09:43:57,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 09:43:57,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:57,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:57,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-03-08 09:43:57,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:57,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840432454] [2025-03-08 09:43:57,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840432454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:57,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:57,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:43:57,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433715997] [2025-03-08 09:43:57,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:57,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:43:57,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:57,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:43:57,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:43:57,983 INFO L87 Difference]: Start difference. First operand 750 states and 1115 transitions. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 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-03-08 09:43:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:58,383 INFO L93 Difference]: Finished difference Result 1652 states and 2454 transitions. [2025-03-08 09:43:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:43:58,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 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-03-08 09:43:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:58,387 INFO L225 Difference]: With dead ends: 1652 [2025-03-08 09:43:58,387 INFO L226 Difference]: Without dead ends: 956 [2025-03-08 09:43:58,388 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-03-08 09:43:58,389 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 173 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 3788 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-03-08 09:43:58,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 3788 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:43:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-08 09:43:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 953. [2025-03-08 09:43:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 952 states have (on average 1.4842436974789917) internal successors, (1413), 952 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:43:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1413 transitions. [2025-03-08 09:43:58,406 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1413 transitions. Word has length 147 [2025-03-08 09:43:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:58,406 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1413 transitions. [2025-03-08 09:43:58,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 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-03-08 09:43:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1413 transitions. [2025-03-08 09:43:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 09:43:58,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:58,407 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-03-08 09:43:58,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 09:43:58,409 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:58,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:58,410 INFO L85 PathProgramCache]: Analyzing trace with hash -199510254, now seen corresponding path program 1 times [2025-03-08 09:43:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:58,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152337649] [2025-03-08 09:43:58,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:58,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 09:43:58,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 09:43:58,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:58,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:58,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152337649] [2025-03-08 09:43:58,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152337649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:58,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:58,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:43:58,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398023867] [2025-03-08 09:43:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:58,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:43:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:58,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:43:58,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:43:58,843 INFO L87 Difference]: Start difference. First operand 953 states and 1413 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-03-08 09:43:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:59,208 INFO L93 Difference]: Finished difference Result 1868 states and 2770 transitions. [2025-03-08 09:43:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:43:59,208 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-03-08 09:43:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:59,212 INFO L225 Difference]: With dead ends: 1868 [2025-03-08 09:43:59,212 INFO L226 Difference]: Without dead ends: 969 [2025-03-08 09:43:59,213 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-03-08 09:43:59,214 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 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-03-08 09:43:59,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:43:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-08 09:43:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 965. [2025-03-08 09:43:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.4823651452282158) internal successors, (1429), 964 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:43:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1429 transitions. [2025-03-08 09:43:59,231 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1429 transitions. Word has length 148 [2025-03-08 09:43:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:59,231 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1429 transitions. [2025-03-08 09:43:59,231 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-03-08 09:43:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1429 transitions. [2025-03-08 09:43:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 09:43:59,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:43:59,232 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-03-08 09:43:59,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 09:43:59,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:43:59,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:43:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2110827527, now seen corresponding path program 1 times [2025-03-08 09:43:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:43:59,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834958731] [2025-03-08 09:43:59,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:43:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:43:59,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 09:43:59,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 09:43:59,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:43:59,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:43:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:43:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:43:59,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834958731] [2025-03-08 09:43:59,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834958731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:43:59,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:43:59,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:43:59,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905373330] [2025-03-08 09:43:59,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:43:59,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:43:59,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:43:59,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:43:59,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:43:59,943 INFO L87 Difference]: Start difference. First operand 965 states and 1429 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:00,493 INFO L93 Difference]: Finished difference Result 1888 states and 2796 transitions. [2025-03-08 09:44:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:00,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-03-08 09:44:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:00,496 INFO L225 Difference]: With dead ends: 1888 [2025-03-08 09:44:00,496 INFO L226 Difference]: Without dead ends: 977 [2025-03-08 09:44:00,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-03-08 09:44:00,497 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 988 mSDsluCounter, 3481 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 4355 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:00,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 4355 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:44:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-08 09:44:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-08 09:44:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.4805327868852458) internal successors, (1445), 976 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1445 transitions. [2025-03-08 09:44:00,510 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1445 transitions. Word has length 149 [2025-03-08 09:44:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:00,510 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1445 transitions. [2025-03-08 09:44:00,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1445 transitions. [2025-03-08 09:44:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 09:44:00,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:00,512 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-03-08 09:44:00,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 09:44:00,512 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:00,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1522707695, now seen corresponding path program 1 times [2025-03-08 09:44:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:00,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381968654] [2025-03-08 09:44:00,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:00,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 09:44:00,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 09:44:00,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:00,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:01,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:01,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381968654] [2025-03-08 09:44:01,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381968654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:01,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:01,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:01,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385611918] [2025-03-08 09:44:01,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:01,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:01,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:01,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:01,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:01,078 INFO L87 Difference]: Start difference. First operand 977 states and 1445 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:01,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:01,667 INFO L93 Difference]: Finished difference Result 1908 states and 2822 transitions. [2025-03-08 09:44:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:44:01,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-03-08 09:44:01,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:01,671 INFO L225 Difference]: With dead ends: 1908 [2025-03-08 09:44:01,671 INFO L226 Difference]: Without dead ends: 985 [2025-03-08 09:44:01,672 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-03-08 09:44:01,673 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 172 mSDsluCounter, 4447 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 5339 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-03-08 09:44:01,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 5339 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:44:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-03-08 09:44:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 984. [2025-03-08 09:44:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 1.4801627670396744) internal successors, (1455), 983 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1455 transitions. [2025-03-08 09:44:01,688 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1455 transitions. Word has length 149 [2025-03-08 09:44:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:01,688 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1455 transitions. [2025-03-08 09:44:01,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1455 transitions. [2025-03-08 09:44:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 09:44:01,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:01,690 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-03-08 09:44:01,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 09:44:01,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:01,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:01,691 INFO L85 PathProgramCache]: Analyzing trace with hash 679461994, now seen corresponding path program 1 times [2025-03-08 09:44:01,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:01,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490312598] [2025-03-08 09:44:01,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:01,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:01,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 09:44:01,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 09:44:01,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:01,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:01,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:01,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490312598] [2025-03-08 09:44:01,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490312598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:01,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:01,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:01,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372819626] [2025-03-08 09:44:01,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:01,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:01,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:01,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:01,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:01,953 INFO L87 Difference]: Start difference. First operand 984 states and 1455 transitions. Second operand has 5 states, 5 states have (on average 29.8) 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-03-08 09:44:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:02,274 INFO L93 Difference]: Finished difference Result 1932 states and 2857 transitions. [2025-03-08 09:44:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) 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-03-08 09:44:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:02,278 INFO L225 Difference]: With dead ends: 1932 [2025-03-08 09:44:02,278 INFO L226 Difference]: Without dead ends: 1002 [2025-03-08 09:44:02,279 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-03-08 09:44:02,279 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 16 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3574 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-03-08 09:44:02,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-03-08 09:44:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2025-03-08 09:44:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 1001 states have (on average 1.4795204795204795) internal successors, (1481), 1001 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1481 transitions. [2025-03-08 09:44:02,295 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1481 transitions. Word has length 149 [2025-03-08 09:44:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:02,295 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1481 transitions. [2025-03-08 09:44:02,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) 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-03-08 09:44:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1481 transitions. [2025-03-08 09:44:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 09:44:02,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:02,297 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-03-08 09:44:02,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 09:44:02,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash -521100457, now seen corresponding path program 1 times [2025-03-08 09:44:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:02,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611951874] [2025-03-08 09:44:02,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:02,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 09:44:02,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 09:44:02,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:02,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:02,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:02,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611951874] [2025-03-08 09:44:02,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611951874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:02,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:02,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:02,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325260731] [2025-03-08 09:44:02,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:02,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:02,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:02,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:02,869 INFO L87 Difference]: Start difference. First operand 1002 states and 1481 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 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-03-08 09:44:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:03,342 INFO L93 Difference]: Finished difference Result 2363 states and 3487 transitions. [2025-03-08 09:44:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:03,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 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-03-08 09:44:03,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:03,347 INFO L225 Difference]: With dead ends: 2363 [2025-03-08 09:44:03,347 INFO L226 Difference]: Without dead ends: 1415 [2025-03-08 09:44:03,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-03-08 09:44:03,349 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 2134 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2134 SdHoareTripleChecker+Valid, 3531 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:03,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2134 Valid, 3531 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:44:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2025-03-08 09:44:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1008. [2025-03-08 09:44:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 1.4786494538232373) internal successors, (1489), 1007 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1489 transitions. [2025-03-08 09:44:03,366 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1489 transitions. Word has length 150 [2025-03-08 09:44:03,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:03,366 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1489 transitions. [2025-03-08 09:44:03,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 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-03-08 09:44:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1489 transitions. [2025-03-08 09:44:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 09:44:03,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:03,368 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-03-08 09:44:03,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 09:44:03,369 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:03,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1041807928, now seen corresponding path program 1 times [2025-03-08 09:44:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:03,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648441546] [2025-03-08 09:44:03,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:03,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:03,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 09:44:03,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 09:44:03,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:03,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:03,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648441546] [2025-03-08 09:44:03,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648441546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:03,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:03,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:03,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933217689] [2025-03-08 09:44:03,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:03,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:03,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:03,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:03,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:03,603 INFO L87 Difference]: Start difference. First operand 1008 states and 1489 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-03-08 09:44:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:03,933 INFO L93 Difference]: Finished difference Result 1982 states and 2928 transitions. [2025-03-08 09:44:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:03,934 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-03-08 09:44:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:03,937 INFO L225 Difference]: With dead ends: 1982 [2025-03-08 09:44:03,937 INFO L226 Difference]: Without dead ends: 1028 [2025-03-08 09:44:03,938 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-03-08 09:44:03,938 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3574 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-03-08 09:44:03,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-03-08 09:44:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1028. [2025-03-08 09:44:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1027 states have (on average 1.4771178188899707) internal successors, (1517), 1027 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1517 transitions. [2025-03-08 09:44:03,954 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1517 transitions. Word has length 151 [2025-03-08 09:44:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:03,954 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1517 transitions. [2025-03-08 09:44:03,954 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-03-08 09:44:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1517 transitions. [2025-03-08 09:44:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 09:44:03,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:03,956 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-03-08 09:44:03,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 09:44:03,956 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:03,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:03,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1258583232, now seen corresponding path program 1 times [2025-03-08 09:44:03,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:03,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152563025] [2025-03-08 09:44:03,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:03,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:03,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 09:44:04,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 09:44:04,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:04,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:04,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:04,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152563025] [2025-03-08 09:44:04,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152563025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:04,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:04,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 09:44:04,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249728515] [2025-03-08 09:44:04,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:04,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:44:04,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:04,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:44:04,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:44:04,522 INFO L87 Difference]: Start difference. First operand 1028 states and 1517 transitions. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 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-03-08 09:44:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:05,049 INFO L93 Difference]: Finished difference Result 2006 states and 2959 transitions. [2025-03-08 09:44:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:44:05,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 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-03-08 09:44:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:05,053 INFO L225 Difference]: With dead ends: 2006 [2025-03-08 09:44:05,053 INFO L226 Difference]: Without dead ends: 1032 [2025-03-08 09:44:05,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:44:05,054 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 1088 mSDsluCounter, 4433 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 5323 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:05,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 5323 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:44:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-08 09:44:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1028. [2025-03-08 09:44:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1027 states have (on average 1.4771178188899707) internal successors, (1517), 1027 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1517 transitions. [2025-03-08 09:44:05,068 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1517 transitions. Word has length 151 [2025-03-08 09:44:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:05,068 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1517 transitions. [2025-03-08 09:44:05,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 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-03-08 09:44:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1517 transitions. [2025-03-08 09:44:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 09:44:05,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:05,069 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-03-08 09:44:05,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 09:44:05,070 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:05,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash -280844157, now seen corresponding path program 1 times [2025-03-08 09:44:05,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:05,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558359547] [2025-03-08 09:44:05,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:05,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 09:44:05,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 09:44:05,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:05,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:05,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558359547] [2025-03-08 09:44:05,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558359547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:05,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:05,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:05,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983789585] [2025-03-08 09:44:05,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:05,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:05,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:05,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:05,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:05,289 INFO L87 Difference]: Start difference. First operand 1028 states and 1517 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:05,603 INFO L93 Difference]: Finished difference Result 2062 states and 3040 transitions. [2025-03-08 09:44:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:05,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-03-08 09:44:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:05,606 INFO L225 Difference]: With dead ends: 2062 [2025-03-08 09:44:05,606 INFO L226 Difference]: Without dead ends: 1088 [2025-03-08 09:44:05,608 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-03-08 09:44:05,608 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 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-03-08 09:44:05,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-03-08 09:44:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2025-03-08 09:44:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.4728610855565778) internal successors, (1601), 1087 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1601 transitions. [2025-03-08 09:44:05,620 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1601 transitions. Word has length 152 [2025-03-08 09:44:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:05,620 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1601 transitions. [2025-03-08 09:44:05,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1601 transitions. [2025-03-08 09:44:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 09:44:05,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:05,622 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-03-08 09:44:05,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 09:44:05,622 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:05,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1897493820, now seen corresponding path program 1 times [2025-03-08 09:44:05,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:05,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704366333] [2025-03-08 09:44:05,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:05,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 09:44:05,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 09:44:05,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:05,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:06,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:06,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704366333] [2025-03-08 09:44:06,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704366333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:06,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:06,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:06,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217383536] [2025-03-08 09:44:06,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:06,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:06,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:06,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:06,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:06,283 INFO L87 Difference]: Start difference. First operand 1088 states and 1601 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-03-08 09:44:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:06,812 INFO L93 Difference]: Finished difference Result 2577 states and 3785 transitions. [2025-03-08 09:44:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:06,812 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-03-08 09:44:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:06,816 INFO L225 Difference]: With dead ends: 2577 [2025-03-08 09:44:06,816 INFO L226 Difference]: Without dead ends: 1543 [2025-03-08 09:44:06,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-03-08 09:44:06,817 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 1588 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 4739 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:06,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 4739 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:44:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-03-08 09:44:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1088. [2025-03-08 09:44:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.4728610855565778) internal successors, (1601), 1087 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1601 transitions. [2025-03-08 09:44:06,829 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1601 transitions. Word has length 152 [2025-03-08 09:44:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:06,829 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1601 transitions. [2025-03-08 09:44:06,829 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-03-08 09:44:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1601 transitions. [2025-03-08 09:44:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 09:44:06,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:06,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, 1, 1, 1, 1] [2025-03-08 09:44:06,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 09:44:06,831 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:06,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:06,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1933673100, now seen corresponding path program 1 times [2025-03-08 09:44:06,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:06,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175564686] [2025-03-08 09:44:06,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:06,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 09:44:06,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 09:44:06,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:06,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:07,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:07,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175564686] [2025-03-08 09:44:07,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175564686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:07,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:07,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:07,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349689206] [2025-03-08 09:44:07,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:07,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:07,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:07,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:07,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:07,118 INFO L87 Difference]: Start difference. First operand 1088 states and 1601 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-03-08 09:44:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:07,422 INFO L93 Difference]: Finished difference Result 2142 states and 3152 transitions. [2025-03-08 09:44:07,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:07,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-03-08 09:44:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:07,426 INFO L225 Difference]: With dead ends: 2142 [2025-03-08 09:44:07,426 INFO L226 Difference]: Without dead ends: 1108 [2025-03-08 09:44:07,427 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-03-08 09:44:07,427 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 3569 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4465 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:07,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4465 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-03-08 09:44:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-03-08 09:44:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 1.4715447154471544) internal successors, (1629), 1107 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1629 transitions. [2025-03-08 09:44:07,439 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1629 transitions. Word has length 153 [2025-03-08 09:44:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:07,439 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1629 transitions. [2025-03-08 09:44:07,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-03-08 09:44:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1629 transitions. [2025-03-08 09:44:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 09:44:07,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:07,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] [2025-03-08 09:44:07,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 09:44:07,441 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:07,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1028212605, now seen corresponding path program 1 times [2025-03-08 09:44:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:07,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353365703] [2025-03-08 09:44:07,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:07,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:07,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 09:44:07,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 09:44:07,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:07,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353365703] [2025-03-08 09:44:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353365703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:07,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:07,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:07,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098550653] [2025-03-08 09:44:07,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:07,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:07,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:07,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:07,937 INFO L87 Difference]: Start difference. First operand 1108 states and 1629 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-03-08 09:44:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:08,292 INFO L93 Difference]: Finished difference Result 2571 states and 3771 transitions. [2025-03-08 09:44:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:08,293 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-03-08 09:44:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:08,297 INFO L225 Difference]: With dead ends: 2571 [2025-03-08 09:44:08,297 INFO L226 Difference]: Without dead ends: 1517 [2025-03-08 09:44:08,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03-08 09:44:08,298 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 514 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 3470 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:08,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 3470 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-03-08 09:44:08,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1110. [2025-03-08 09:44:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 1.4706943192064923) internal successors, (1631), 1109 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1631 transitions. [2025-03-08 09:44:08,312 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1631 transitions. Word has length 153 [2025-03-08 09:44:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:08,312 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1631 transitions. [2025-03-08 09:44:08,312 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-03-08 09:44:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1631 transitions. [2025-03-08 09:44:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 09:44:08,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:08,313 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-03-08 09:44:08,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 09:44:08,314 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:08,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2123444014, now seen corresponding path program 1 times [2025-03-08 09:44:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:08,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993850046] [2025-03-08 09:44:08,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:08,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:08,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 09:44:08,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 09:44:08,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:08,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:08,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993850046] [2025-03-08 09:44:08,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993850046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:08,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:08,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:08,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177271310] [2025-03-08 09:44:08,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:08,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:08,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:08,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:08,543 INFO L87 Difference]: Start difference. First operand 1110 states and 1631 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-03-08 09:44:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:08,877 INFO L93 Difference]: Finished difference Result 2232 states and 3278 transitions. [2025-03-08 09:44:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:08,879 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-03-08 09:44:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:08,881 INFO L225 Difference]: With dead ends: 2232 [2025-03-08 09:44:08,881 INFO L226 Difference]: Without dead ends: 1178 [2025-03-08 09:44:08,882 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-03-08 09:44:08,882 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 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-03-08 09:44:08,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2025-03-08 09:44:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1178. [2025-03-08 09:44:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.4672897196261683) internal successors, (1727), 1177 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1727 transitions. [2025-03-08 09:44:08,896 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1727 transitions. Word has length 154 [2025-03-08 09:44:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:08,896 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1727 transitions. [2025-03-08 09:44:08,896 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-03-08 09:44:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1727 transitions. [2025-03-08 09:44:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 09:44:08,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:08,897 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-03-08 09:44:08,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 09:44:08,897 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:08,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:08,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1667403672, now seen corresponding path program 1 times [2025-03-08 09:44:08,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:08,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266497566] [2025-03-08 09:44:08,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:08,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 09:44:08,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 09:44:08,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:08,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:09,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:09,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266497566] [2025-03-08 09:44:09,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266497566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:09,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:09,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:09,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193892288] [2025-03-08 09:44:09,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:09,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:09,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:09,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:09,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:09,131 INFO L87 Difference]: Start difference. First operand 1178 states and 1727 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-03-08 09:44:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:09,431 INFO L93 Difference]: Finished difference Result 2320 states and 3402 transitions. [2025-03-08 09:44:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:09,432 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-03-08 09:44:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:09,434 INFO L225 Difference]: With dead ends: 2320 [2025-03-08 09:44:09,434 INFO L226 Difference]: Without dead ends: 1198 [2025-03-08 09:44:09,435 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-03-08 09:44:09,436 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3574 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-03-08 09:44:09,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-08 09:44:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-03-08 09:44:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1197 states have (on average 1.4661654135338347) internal successors, (1755), 1197 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1755 transitions. [2025-03-08 09:44:09,446 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1755 transitions. Word has length 155 [2025-03-08 09:44:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:09,446 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1755 transitions. [2025-03-08 09:44:09,446 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-03-08 09:44:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1755 transitions. [2025-03-08 09:44:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 09:44:09,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:09,447 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-03-08 09:44:09,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 09:44:09,448 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:09,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:09,448 INFO L85 PathProgramCache]: Analyzing trace with hash 374914243, now seen corresponding path program 1 times [2025-03-08 09:44:09,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:09,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307819622] [2025-03-08 09:44:09,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:09,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:09,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 09:44:09,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 09:44:09,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:09,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:09,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-03-08 09:44:09,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:09,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307819622] [2025-03-08 09:44:09,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307819622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:09,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:09,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:09,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181026565] [2025-03-08 09:44:09,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:09,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:09,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:09,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:09,651 INFO L87 Difference]: Start difference. First operand 1198 states and 1755 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-03-08 09:44:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:09,956 INFO L93 Difference]: Finished difference Result 2396 states and 3510 transitions. [2025-03-08 09:44:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:09,957 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-03-08 09:44:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:09,959 INFO L225 Difference]: With dead ends: 2396 [2025-03-08 09:44:09,959 INFO L226 Difference]: Without dead ends: 1254 [2025-03-08 09:44:09,960 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-03-08 09:44:09,963 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 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-03-08 09:44:09,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-08 09:44:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2025-03-08 09:44:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.464485235434956) internal successors, (1835), 1253 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1835 transitions. [2025-03-08 09:44:09,974 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1835 transitions. Word has length 156 [2025-03-08 09:44:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:09,974 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1835 transitions. [2025-03-08 09:44:09,974 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-03-08 09:44:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1835 transitions. [2025-03-08 09:44:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 09:44:09,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:09,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] [2025-03-08 09:44:09,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 09:44:09,975 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:09,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:09,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1598471444, now seen corresponding path program 1 times [2025-03-08 09:44:09,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:09,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402167835] [2025-03-08 09:44:09,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 09:44:10,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 09:44:10,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:10,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:10,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:10,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402167835] [2025-03-08 09:44:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402167835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:10,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:10,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:10,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937405709] [2025-03-08 09:44:10,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:10,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:10,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:10,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:10,266 INFO L87 Difference]: Start difference. First operand 1254 states and 1835 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-03-08 09:44:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:10,500 INFO L93 Difference]: Finished difference Result 2472 states and 3618 transitions. [2025-03-08 09:44:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:10,500 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-03-08 09:44:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:10,503 INFO L225 Difference]: With dead ends: 2472 [2025-03-08 09:44:10,503 INFO L226 Difference]: Without dead ends: 1274 [2025-03-08 09:44:10,504 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-03-08 09:44:10,504 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3574 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:10,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:44:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2025-03-08 09:44:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2025-03-08 09:44:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 1.4634721131186175) internal successors, (1863), 1273 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1863 transitions. [2025-03-08 09:44:10,530 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1863 transitions. Word has length 157 [2025-03-08 09:44:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:10,531 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1863 transitions. [2025-03-08 09:44:10,531 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-03-08 09:44:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1863 transitions. [2025-03-08 09:44:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 09:44:10,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:10,532 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-03-08 09:44:10,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 09:44:10,532 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:10,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:10,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2042550702, now seen corresponding path program 1 times [2025-03-08 09:44:10,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:10,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427442570] [2025-03-08 09:44:10,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:10,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 09:44:10,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 09:44:10,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:10,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:10,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427442570] [2025-03-08 09:44:10,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427442570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:10,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:10,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:10,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615416431] [2025-03-08 09:44:10,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:10,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:10,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:10,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:10,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:10,739 INFO L87 Difference]: Start difference. First operand 1274 states and 1863 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:11,036 INFO L93 Difference]: Finished difference Result 2548 states and 3726 transitions. [2025-03-08 09:44:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:11,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2025-03-08 09:44:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:11,039 INFO L225 Difference]: With dead ends: 2548 [2025-03-08 09:44:11,039 INFO L226 Difference]: Without dead ends: 1330 [2025-03-08 09:44:11,040 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-03-08 09:44:11,041 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 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-03-08 09:44:11,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-08 09:44:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2025-03-08 09:44:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1329 states have (on average 1.4620015048908954) internal successors, (1943), 1329 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1943 transitions. [2025-03-08 09:44:11,051 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1943 transitions. Word has length 158 [2025-03-08 09:44:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:11,051 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1943 transitions. [2025-03-08 09:44:11,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1943 transitions. [2025-03-08 09:44:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 09:44:11,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:11,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:44:11,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 09:44:11,052 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:11,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1109011208, now seen corresponding path program 1 times [2025-03-08 09:44:11,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:11,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183446876] [2025-03-08 09:44:11,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:11,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 09:44:11,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 09:44:11,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:11,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:11,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:11,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183446876] [2025-03-08 09:44:11,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183446876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:11,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:11,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 09:44:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318632496] [2025-03-08 09:44:11,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:11,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 09:44:11,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:11,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 09:44:11,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:44:11,855 INFO L87 Difference]: Start difference. First operand 1330 states and 1943 transitions. Second operand has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 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-03-08 09:44:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:12,799 INFO L93 Difference]: Finished difference Result 2724 states and 3982 transitions. [2025-03-08 09:44:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 09:44:12,800 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 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-03-08 09:44:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:12,803 INFO L225 Difference]: With dead ends: 2724 [2025-03-08 09:44:12,803 INFO L226 Difference]: Without dead ends: 1450 [2025-03-08 09:44:12,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:44:12,805 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 49 mSDsluCounter, 11805 mSDsCounter, 0 mSdLazyCounter, 2983 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 12718 SdHoareTripleChecker+Invalid, 2984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:12,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 12718 Invalid, 2984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2983 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 09:44:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-08 09:44:12,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1428. [2025-03-08 09:44:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.4639103013314647) internal successors, (2089), 1427 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2089 transitions. [2025-03-08 09:44:12,818 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2089 transitions. Word has length 159 [2025-03-08 09:44:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:12,818 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 2089 transitions. [2025-03-08 09:44:12,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 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-03-08 09:44:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2089 transitions. [2025-03-08 09:44:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 09:44:12,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:12,819 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-03-08 09:44:12,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 09:44:12,819 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:12,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1881819842, now seen corresponding path program 1 times [2025-03-08 09:44:12,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:12,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984264699] [2025-03-08 09:44:12,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:12,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 09:44:12,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 09:44:12,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:12,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:13,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-03-08 09:44:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:13,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984264699] [2025-03-08 09:44:13,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984264699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:13,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:13,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:13,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385504519] [2025-03-08 09:44:13,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:13,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:13,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:13,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:13,341 INFO L87 Difference]: Start difference. First operand 1428 states and 2089 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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-03-08 09:44:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:13,707 INFO L93 Difference]: Finished difference Result 2812 states and 4114 transitions. [2025-03-08 09:44:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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-03-08 09:44:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:13,710 INFO L225 Difference]: With dead ends: 2812 [2025-03-08 09:44:13,710 INFO L226 Difference]: Without dead ends: 1440 [2025-03-08 09:44:13,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-03-08 09:44:13,712 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 1043 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 3486 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-03-08 09:44:13,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 3486 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2025-03-08 09:44:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2025-03-08 09:44:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1439 states have (on average 1.462821403752606) internal successors, (2105), 1439 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2105 transitions. [2025-03-08 09:44:13,723 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2105 transitions. Word has length 159 [2025-03-08 09:44:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:13,723 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2105 transitions. [2025-03-08 09:44:13,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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-03-08 09:44:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2105 transitions. [2025-03-08 09:44:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 09:44:13,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:13,724 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-03-08 09:44:13,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 09:44:13,724 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:13,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1409788083, now seen corresponding path program 1 times [2025-03-08 09:44:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:13,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678900513] [2025-03-08 09:44:13,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:13,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 09:44:13,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 09:44:13,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:13,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678900513] [2025-03-08 09:44:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678900513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:14,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854184378] [2025-03-08 09:44:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:14,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:14,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:14,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:14,349 INFO L87 Difference]: Start difference. First operand 1440 states and 2105 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:14,716 INFO L93 Difference]: Finished difference Result 2824 states and 4128 transitions. [2025-03-08 09:44:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:44:14,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-08 09:44:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:14,719 INFO L225 Difference]: With dead ends: 2824 [2025-03-08 09:44:14,719 INFO L226 Difference]: Without dead ends: 1440 [2025-03-08 09:44:14,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:14,720 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 11 mSDsluCounter, 4422 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5310 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:14,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 5310 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2025-03-08 09:44:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2025-03-08 09:44:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1439 states have (on average 1.4614315496872827) internal successors, (2103), 1439 states have internal predecessors, (2103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2103 transitions. [2025-03-08 09:44:14,731 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2103 transitions. Word has length 160 [2025-03-08 09:44:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:14,731 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2103 transitions. [2025-03-08 09:44:14,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2103 transitions. [2025-03-08 09:44:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 09:44:14,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:14,732 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-03-08 09:44:14,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 09:44:14,732 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:14,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1494024331, now seen corresponding path program 1 times [2025-03-08 09:44:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:14,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40898722] [2025-03-08 09:44:14,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:14,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 09:44:14,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 09:44:14,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:14,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:15,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40898722] [2025-03-08 09:44:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40898722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:15,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656372964] [2025-03-08 09:44:15,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:15,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:15,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:15,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:15,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:15,033 INFO L87 Difference]: Start difference. First operand 1440 states and 2103 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) 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-03-08 09:44:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:15,359 INFO L93 Difference]: Finished difference Result 2844 states and 4154 transitions. [2025-03-08 09:44:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:15,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) 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-03-08 09:44:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:15,362 INFO L225 Difference]: With dead ends: 2844 [2025-03-08 09:44:15,362 INFO L226 Difference]: Without dead ends: 1460 [2025-03-08 09:44:15,363 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-03-08 09:44:15,363 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-03-08 09:44:15,364 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-03-08 09:44:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2025-03-08 09:44:15,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1452. [2025-03-08 09:44:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1451 states have (on average 1.4603721571330117) internal successors, (2119), 1451 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2119 transitions. [2025-03-08 09:44:15,375 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2119 transitions. Word has length 160 [2025-03-08 09:44:15,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:15,375 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 2119 transitions. [2025-03-08 09:44:15,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) 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-03-08 09:44:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2119 transitions. [2025-03-08 09:44:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 09:44:15,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:15,376 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-03-08 09:44:15,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 09:44:15,376 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:15,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:15,376 INFO L85 PathProgramCache]: Analyzing trace with hash -281624372, now seen corresponding path program 1 times [2025-03-08 09:44:15,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:15,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986198964] [2025-03-08 09:44:15,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:15,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:15,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 09:44:15,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 09:44:15,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:15,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:15,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:15,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986198964] [2025-03-08 09:44:15,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986198964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:15,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:15,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127148866] [2025-03-08 09:44:15,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:15,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:15,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:15,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:15,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:15,856 INFO L87 Difference]: Start difference. First operand 1452 states and 2119 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-03-08 09:44:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:16,246 INFO L93 Difference]: Finished difference Result 2948 states and 4296 transitions. [2025-03-08 09:44:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:16,247 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-03-08 09:44:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:16,249 INFO L225 Difference]: With dead ends: 2948 [2025-03-08 09:44:16,249 INFO L226 Difference]: Without dead ends: 1552 [2025-03-08 09:44:16,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-03-08 09:44:16,251 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 983 mSDsluCounter, 3474 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 4347 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-03-08 09:44:16,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 4347 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:44:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2025-03-08 09:44:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2025-03-08 09:44:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 1.4539007092198581) internal successors, (2255), 1551 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2255 transitions. [2025-03-08 09:44:16,263 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2255 transitions. Word has length 161 [2025-03-08 09:44:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:16,263 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2255 transitions. [2025-03-08 09:44:16,263 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-03-08 09:44:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2255 transitions. [2025-03-08 09:44:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 09:44:16,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:16,264 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-03-08 09:44:16,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 09:44:16,264 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:16,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:16,264 INFO L85 PathProgramCache]: Analyzing trace with hash 439070055, now seen corresponding path program 1 times [2025-03-08 09:44:16,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:16,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717365766] [2025-03-08 09:44:16,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:16,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:16,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 09:44:16,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 09:44:16,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:16,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:16,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:16,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717365766] [2025-03-08 09:44:16,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717365766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:16,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:16,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:16,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693269413] [2025-03-08 09:44:16,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:16,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:16,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:16,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:16,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:16,536 INFO L87 Difference]: Start difference. First operand 1552 states and 2255 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 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-03-08 09:44:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:17,016 INFO L93 Difference]: Finished difference Result 3068 states and 4460 transitions. [2025-03-08 09:44:17,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:17,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 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-03-08 09:44:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:17,019 INFO L225 Difference]: With dead ends: 3068 [2025-03-08 09:44:17,019 INFO L226 Difference]: Without dead ends: 1572 [2025-03-08 09:44:17,020 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-03-08 09:44:17,020 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:17,020 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.5s Time] [2025-03-08 09:44:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-08 09:44:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1568. [2025-03-08 09:44:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.4518187619655392) internal successors, (2275), 1567 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2275 transitions. [2025-03-08 09:44:17,032 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2275 transitions. Word has length 161 [2025-03-08 09:44:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:17,032 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2275 transitions. [2025-03-08 09:44:17,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 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-03-08 09:44:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2275 transitions. [2025-03-08 09:44:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 09:44:17,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:17,033 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-03-08 09:44:17,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 09:44:17,033 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:17,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash -81003993, now seen corresponding path program 1 times [2025-03-08 09:44:17,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:17,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813639552] [2025-03-08 09:44:17,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:17,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:17,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 09:44:17,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 09:44:17,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:17,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:17,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813639552] [2025-03-08 09:44:17,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813639552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:17,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:17,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122544091] [2025-03-08 09:44:17,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:17,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:17,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:17,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:17,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:17,426 INFO L87 Difference]: Start difference. First operand 1568 states and 2275 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-03-08 09:44:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:17,822 INFO L93 Difference]: Finished difference Result 3130 states and 4538 transitions. [2025-03-08 09:44:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:17,823 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-03-08 09:44:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:17,825 INFO L225 Difference]: With dead ends: 3130 [2025-03-08 09:44:17,825 INFO L226 Difference]: Without dead ends: 1618 [2025-03-08 09:44:17,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-03-08 09:44:17,827 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1050 mSDsluCounter, 3472 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 4345 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-03-08 09:44:17,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 4345 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:44:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-03-08 09:44:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2025-03-08 09:44:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1617 states have (on average 1.4477427334570192) internal successors, (2341), 1617 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2341 transitions. [2025-03-08 09:44:17,837 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2341 transitions. Word has length 162 [2025-03-08 09:44:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:17,838 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2341 transitions. [2025-03-08 09:44:17,838 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-03-08 09:44:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2341 transitions. [2025-03-08 09:44:17,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 09:44:17,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:17,839 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-03-08 09:44:17,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 09:44:17,839 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:17,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -352585492, now seen corresponding path program 1 times [2025-03-08 09:44:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342985877] [2025-03-08 09:44:17,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:17,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 09:44:18,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 09:44:18,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:18,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342985877] [2025-03-08 09:44:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342985877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403495398] [2025-03-08 09:44:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:18,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:18,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:18,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:18,481 INFO L87 Difference]: Start difference. First operand 1618 states and 2341 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-03-08 09:44:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:18,849 INFO L93 Difference]: Finished difference Result 3200 states and 4630 transitions. [2025-03-08 09:44:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:18,849 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-03-08 09:44:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:18,851 INFO L225 Difference]: With dead ends: 3200 [2025-03-08 09:44:18,851 INFO L226 Difference]: Without dead ends: 1638 [2025-03-08 09:44:18,852 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-03-08 09:44:18,853 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-03-08 09:44:18,853 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-03-08 09:44:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-03-08 09:44:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1630. [2025-03-08 09:44:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1629 states have (on average 1.4468999386126458) internal successors, (2357), 1629 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2357 transitions. [2025-03-08 09:44:18,866 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2357 transitions. Word has length 162 [2025-03-08 09:44:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:18,866 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2357 transitions. [2025-03-08 09:44:18,867 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-03-08 09:44:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2357 transitions. [2025-03-08 09:44:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 09:44:18,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:18,868 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-03-08 09:44:18,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 09:44:18,868 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:18,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2140691881, now seen corresponding path program 1 times [2025-03-08 09:44:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:18,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101573133] [2025-03-08 09:44:18,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:18,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 09:44:19,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 09:44:19,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:19,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:20,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101573133] [2025-03-08 09:44:20,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101573133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:20,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:20,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-03-08 09:44:20,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747525607] [2025-03-08 09:44:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:20,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 09:44:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:20,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 09:44:20,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2025-03-08 09:44:20,203 INFO L87 Difference]: Start difference. First operand 1630 states and 2357 transitions. Second operand has 31 states, 31 states have (on average 5.258064516129032) internal successors, (163), 31 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-03-08 09:44:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:22,440 INFO L93 Difference]: Finished difference Result 3696 states and 5344 transitions. [2025-03-08 09:44:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 09:44:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.258064516129032) internal successors, (163), 31 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-03-08 09:44:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:22,446 INFO L225 Difference]: With dead ends: 3696 [2025-03-08 09:44:22,446 INFO L226 Difference]: Without dead ends: 2122 [2025-03-08 09:44:22,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=1050, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 09:44:22,448 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 132 mSDsluCounter, 24473 mSDsCounter, 0 mSdLazyCounter, 7002 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 25319 SdHoareTripleChecker+Invalid, 7022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:22,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 25319 Invalid, 7022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 7002 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 09:44:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2025-03-08 09:44:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2084. [2025-03-08 09:44:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 2083 states have (on average 1.4483917426788286) internal successors, (3017), 2083 states have internal predecessors, (3017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3017 transitions. [2025-03-08 09:44:22,472 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3017 transitions. Word has length 163 [2025-03-08 09:44:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:22,472 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 3017 transitions. [2025-03-08 09:44:22,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.258064516129032) internal successors, (163), 31 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-03-08 09:44:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3017 transitions. [2025-03-08 09:44:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 09:44:22,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:22,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] [2025-03-08 09:44:22,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 09:44:22,474 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:22,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash -687711982, now seen corresponding path program 1 times [2025-03-08 09:44:22,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:22,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570511846] [2025-03-08 09:44:22,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:22,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:22,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 09:44:22,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 09:44:22,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:22,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:23,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:23,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570511846] [2025-03-08 09:44:23,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570511846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:23,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:23,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 09:44:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527518342] [2025-03-08 09:44:23,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:23,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 09:44:23,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:23,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 09:44:23,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:44:23,205 INFO L87 Difference]: Start difference. First operand 2084 states and 3017 transitions. Second operand has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 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-03-08 09:44:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:24,121 INFO L93 Difference]: Finished difference Result 4284 states and 6208 transitions. [2025-03-08 09:44:24,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 09:44:24,121 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 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-03-08 09:44:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:24,124 INFO L225 Difference]: With dead ends: 4284 [2025-03-08 09:44:24,124 INFO L226 Difference]: Without dead ends: 2256 [2025-03-08 09:44:24,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-08 09:44:24,126 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 55 mSDsluCounter, 11769 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 12683 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:24,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 12683 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2938 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 09:44:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-08 09:44:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2116. [2025-03-08 09:44:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 2115 states have (on average 1.4472813238770685) internal successors, (3061), 2115 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3061 transitions. [2025-03-08 09:44:24,157 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3061 transitions. Word has length 164 [2025-03-08 09:44:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:24,157 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 3061 transitions. [2025-03-08 09:44:24,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 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-03-08 09:44:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3061 transitions. [2025-03-08 09:44:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 09:44:24,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:24,159 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-03-08 09:44:24,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 09:44:24,159 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:24,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash 306974338, now seen corresponding path program 1 times [2025-03-08 09:44:24,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461622818] [2025-03-08 09:44:24,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:24,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 09:44:24,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 09:44:24,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:24,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:24,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:24,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:24,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461622818] [2025-03-08 09:44:24,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461622818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:24,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:24,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:24,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57433222] [2025-03-08 09:44:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:24,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:24,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:24,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:24,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:24,516 INFO L87 Difference]: Start difference. First operand 2116 states and 3061 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-03-08 09:44:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:24,840 INFO L93 Difference]: Finished difference Result 4324 states and 6254 transitions. [2025-03-08 09:44:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-03-08 09:44:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:24,843 INFO L225 Difference]: With dead ends: 4324 [2025-03-08 09:44:24,843 INFO L226 Difference]: Without dead ends: 2264 [2025-03-08 09:44:24,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 09:44:24,844 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1003 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 3479 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:24,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 3479 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2025-03-08 09:44:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2264. [2025-03-08 09:44:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2263 states have (on average 1.4427750773309767) internal successors, (3265), 2263 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3265 transitions. [2025-03-08 09:44:24,858 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3265 transitions. Word has length 165 [2025-03-08 09:44:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:24,858 INFO L471 AbstractCegarLoop]: Abstraction has 2264 states and 3265 transitions. [2025-03-08 09:44:24,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-03-08 09:44:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3265 transitions. [2025-03-08 09:44:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 09:44:24,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:24,859 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-03-08 09:44:24,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 09:44:24,860 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:24,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1609593926, now seen corresponding path program 1 times [2025-03-08 09:44:24,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:24,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621863796] [2025-03-08 09:44:24,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:24,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:24,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 09:44:24,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 09:44:24,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:24,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:25,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:25,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621863796] [2025-03-08 09:44:25,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621863796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:25,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:25,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:25,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640925360] [2025-03-08 09:44:25,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:25,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:25,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:25,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:25,271 INFO L87 Difference]: Start difference. First operand 2264 states and 3265 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-03-08 09:44:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:25,565 INFO L93 Difference]: Finished difference Result 4498 states and 6490 transitions. [2025-03-08 09:44:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:25,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-03-08 09:44:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:25,568 INFO L225 Difference]: With dead ends: 4498 [2025-03-08 09:44:25,569 INFO L226 Difference]: Without dead ends: 2290 [2025-03-08 09:44:25,570 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-03-08 09:44:25,570 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03-08 09:44:25,570 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-03-08 09:44:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2025-03-08 09:44:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2242. [2025-03-08 09:44:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2241 states have (on average 1.4444444444444444) internal successors, (3237), 2241 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3237 transitions. [2025-03-08 09:44:25,585 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3237 transitions. Word has length 165 [2025-03-08 09:44:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:25,585 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 3237 transitions. [2025-03-08 09:44:25,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-03-08 09:44:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3237 transitions. [2025-03-08 09:44:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 09:44:25,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:25,586 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-03-08 09:44:25,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 09:44:25,587 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:25,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash 830183965, now seen corresponding path program 1 times [2025-03-08 09:44:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184151644] [2025-03-08 09:44:25,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:25,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 09:44:25,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 09:44:25,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:25,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:26,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184151644] [2025-03-08 09:44:26,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184151644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:26,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:26,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-08 09:44:26,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041924794] [2025-03-08 09:44:26,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:26,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 09:44:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:26,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 09:44:26,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2025-03-08 09:44:26,538 INFO L87 Difference]: Start difference. First operand 2242 states and 3237 transitions. Second operand has 25 states, 25 states have (on average 6.6) internal successors, (165), 25 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-03-08 09:44:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:28,284 INFO L93 Difference]: Finished difference Result 4472 states and 6452 transitions. [2025-03-08 09:44:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 09:44:28,285 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.6) internal successors, (165), 25 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-03-08 09:44:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:28,287 INFO L225 Difference]: With dead ends: 4472 [2025-03-08 09:44:28,287 INFO L226 Difference]: Without dead ends: 2286 [2025-03-08 09:44:28,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 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-03-08 09:44:28,290 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 103 mSDsluCounter, 19683 mSDsCounter, 0 mSdLazyCounter, 5314 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 20541 SdHoareTripleChecker+Invalid, 5328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:28,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 20541 Invalid, 5328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 5314 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 09:44:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2025-03-08 09:44:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2258. [2025-03-08 09:44:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 1.4448382809038547) internal successors, (3261), 2257 states have internal predecessors, (3261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3261 transitions. [2025-03-08 09:44:28,305 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3261 transitions. Word has length 165 [2025-03-08 09:44:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:28,305 INFO L471 AbstractCegarLoop]: Abstraction has 2258 states and 3261 transitions. [2025-03-08 09:44:28,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.6) internal successors, (165), 25 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-03-08 09:44:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3261 transitions. [2025-03-08 09:44:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 09:44:28,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:28,307 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-03-08 09:44:28,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 09:44:28,307 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:28,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:28,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1418821391, now seen corresponding path program 1 times [2025-03-08 09:44:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:28,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461507748] [2025-03-08 09:44:28,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:28,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 09:44:28,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 09:44:28,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:28,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:28,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-03-08 09:44:28,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:28,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461507748] [2025-03-08 09:44:28,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461507748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:28,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:28,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:28,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463736886] [2025-03-08 09:44:28,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:28,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:28,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:28,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:28,683 INFO L87 Difference]: Start difference. First operand 2258 states and 3261 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-03-08 09:44:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:28,982 INFO L93 Difference]: Finished difference Result 4508 states and 6504 transitions. [2025-03-08 09:44:28,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:28,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-03-08 09:44:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:28,985 INFO L225 Difference]: With dead ends: 4508 [2025-03-08 09:44:28,985 INFO L226 Difference]: Without dead ends: 2306 [2025-03-08 09:44:28,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 09:44:28,986 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1050 mSDsluCounter, 2604 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 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-03-08 09:44:28,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 3477 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-08 09:44:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2254. [2025-03-08 09:44:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 1.4456280514869064) internal successors, (3257), 2253 states have internal predecessors, (3257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3257 transitions. [2025-03-08 09:44:29,000 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3257 transitions. Word has length 165 [2025-03-08 09:44:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:29,000 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3257 transitions. [2025-03-08 09:44:29,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-03-08 09:44:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3257 transitions. [2025-03-08 09:44:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 09:44:29,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:29,003 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-03-08 09:44:29,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 09:44:29,003 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:29,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash 439359966, now seen corresponding path program 1 times [2025-03-08 09:44:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:29,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218277540] [2025-03-08 09:44:29,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:29,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 09:44:29,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 09:44:29,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:29,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:29,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:29,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218277540] [2025-03-08 09:44:29,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218277540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:29,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:29,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:29,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407408055] [2025-03-08 09:44:29,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:29,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:29,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:29,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:29,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:29,325 INFO L87 Difference]: Start difference. First operand 2254 states and 3257 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 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-03-08 09:44:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:29,905 INFO L93 Difference]: Finished difference Result 5407 states and 7799 transitions. [2025-03-08 09:44:29,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:29,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 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-03-08 09:44:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:29,909 INFO L225 Difference]: With dead ends: 5407 [2025-03-08 09:44:29,909 INFO L226 Difference]: Without dead ends: 3209 [2025-03-08 09:44:29,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:29,911 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 1883 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1883 SdHoareTripleChecker+Valid, 2026 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:29,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1883 Valid, 2026 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:44:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2025-03-08 09:44:29,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 2281. [2025-03-08 09:44:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2280 states have (on average 1.4451754385964912) internal successors, (3295), 2280 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3295 transitions. [2025-03-08 09:44:29,929 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3295 transitions. Word has length 166 [2025-03-08 09:44:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:29,930 INFO L471 AbstractCegarLoop]: Abstraction has 2281 states and 3295 transitions. [2025-03-08 09:44:29,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 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-03-08 09:44:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3295 transitions. [2025-03-08 09:44:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 09:44:29,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:29,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, 1, 1, 1] [2025-03-08 09:44:29,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 09:44:29,931 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:29,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash 306529904, now seen corresponding path program 1 times [2025-03-08 09:44:29,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:29,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200871497] [2025-03-08 09:44:29,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:29,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 09:44:30,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 09:44:30,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:30,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:30,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200871497] [2025-03-08 09:44:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200871497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:30,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126134611] [2025-03-08 09:44:30,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:30,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:30,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:30,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:30,367 INFO L87 Difference]: Start difference. First operand 2281 states and 3295 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 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-03-08 09:44:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:30,625 INFO L93 Difference]: Finished difference Result 4543 states and 6562 transitions. [2025-03-08 09:44:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:30,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 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-03-08 09:44:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:30,627 INFO L225 Difference]: With dead ends: 4543 [2025-03-08 09:44:30,627 INFO L226 Difference]: Without dead ends: 2345 [2025-03-08 09:44:30,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:30,629 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 965 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:30,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 2607 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:44:30,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2025-03-08 09:44:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2345. [2025-03-08 09:44:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2344 states have (on average 1.4381399317406143) internal successors, (3371), 2344 states have internal predecessors, (3371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3371 transitions. [2025-03-08 09:44:30,644 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3371 transitions. Word has length 166 [2025-03-08 09:44:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:30,644 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 3371 transitions. [2025-03-08 09:44:30,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 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-03-08 09:44:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3371 transitions. [2025-03-08 09:44:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 09:44:30,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:30,645 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-03-08 09:44:30,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 09:44:30,645 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:30,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:30,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2009773774, now seen corresponding path program 1 times [2025-03-08 09:44:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:30,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628668549] [2025-03-08 09:44:30,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:30,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 09:44:30,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 09:44:30,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:30,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628668549] [2025-03-08 09:44:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628668549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:31,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:31,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 09:44:31,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050743996] [2025-03-08 09:44:31,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:31,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 09:44:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:31,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 09:44:31,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:44:31,195 INFO L87 Difference]: Start difference. First operand 2345 states and 3371 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 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-03-08 09:44:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:31,706 INFO L93 Difference]: Finished difference Result 4671 states and 6718 transitions. [2025-03-08 09:44:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:44:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 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-03-08 09:44:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:31,708 INFO L225 Difference]: With dead ends: 4671 [2025-03-08 09:44:31,708 INFO L226 Difference]: Without dead ends: 2409 [2025-03-08 09:44:31,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:44:31,710 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 15 mSDsluCounter, 6246 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7145 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:31,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7145 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:44:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2025-03-08 09:44:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2163. [2025-03-08 09:44:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.435245143385754) internal successors, (3103), 2162 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3103 transitions. [2025-03-08 09:44:31,724 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3103 transitions. Word has length 166 [2025-03-08 09:44:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:31,724 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 3103 transitions. [2025-03-08 09:44:31,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 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-03-08 09:44:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3103 transitions. [2025-03-08 09:44:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 09:44:31,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:31,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 09:44:31,726 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:31,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash 405381578, now seen corresponding path program 1 times [2025-03-08 09:44:31,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:31,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532495945] [2025-03-08 09:44:31,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:31,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 09:44:31,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 09:44:31,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:31,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:32,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:32,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532495945] [2025-03-08 09:44:32,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532495945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:32,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:32,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:32,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364701687] [2025-03-08 09:44:32,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:32,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:32,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:32,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:32,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:32,185 INFO L87 Difference]: Start difference. First operand 2163 states and 3103 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 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-03-08 09:44:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:32,494 INFO L93 Difference]: Finished difference Result 4415 states and 6336 transitions. [2025-03-08 09:44:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:32,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 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-03-08 09:44:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:32,496 INFO L225 Difference]: With dead ends: 4415 [2025-03-08 09:44:32,496 INFO L226 Difference]: Without dead ends: 2335 [2025-03-08 09:44:32,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 09:44:32,498 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1031 mSDsluCounter, 2604 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:32,498 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.3s Time] [2025-03-08 09:44:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2025-03-08 09:44:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2335. [2025-03-08 09:44:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2334 states have (on average 1.4323050556983719) internal successors, (3343), 2334 states have internal predecessors, (3343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3343 transitions. [2025-03-08 09:44:32,512 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3343 transitions. Word has length 166 [2025-03-08 09:44:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:32,512 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3343 transitions. [2025-03-08 09:44:32,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 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-03-08 09:44:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3343 transitions. [2025-03-08 09:44:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 09:44:32,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:32,513 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-03-08 09:44:32,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 09:44:32,513 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:32,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash 650965879, now seen corresponding path program 1 times [2025-03-08 09:44:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:32,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300024963] [2025-03-08 09:44:32,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:32,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:32,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 09:44:32,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 09:44:32,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:32,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:32,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:32,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300024963] [2025-03-08 09:44:32,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300024963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:32,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:32,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:32,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46966872] [2025-03-08 09:44:32,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:32,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:32,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:32,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:32,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:32,968 INFO L87 Difference]: Start difference. First operand 2335 states and 3343 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 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-03-08 09:44:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:33,260 INFO L93 Difference]: Finished difference Result 4613 states and 6608 transitions. [2025-03-08 09:44:33,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:33,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 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-03-08 09:44:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:33,262 INFO L225 Difference]: With dead ends: 4613 [2025-03-08 09:44:33,262 INFO L226 Difference]: Without dead ends: 2361 [2025-03-08 09:44:33,264 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-03-08 09:44:33,265 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03-08 09:44:33,265 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-03-08 09:44:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2025-03-08 09:44:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2313. [2025-03-08 09:44:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2312 states have (on average 1.4338235294117647) internal successors, (3315), 2312 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3315 transitions. [2025-03-08 09:44:33,279 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3315 transitions. Word has length 166 [2025-03-08 09:44:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:33,279 INFO L471 AbstractCegarLoop]: Abstraction has 2313 states and 3315 transitions. [2025-03-08 09:44:33,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 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-03-08 09:44:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3315 transitions. [2025-03-08 09:44:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 09:44:33,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:33,281 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-03-08 09:44:33,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 09:44:33,281 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:33,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1046530097, now seen corresponding path program 1 times [2025-03-08 09:44:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:33,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454752178] [2025-03-08 09:44:33,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:33,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 09:44:33,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 09:44:33,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:33,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:33,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:33,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454752178] [2025-03-08 09:44:33,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454752178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:33,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:33,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 09:44:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890077291] [2025-03-08 09:44:33,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:33,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 09:44:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:33,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 09:44:33,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:44:33,904 INFO L87 Difference]: Start difference. First operand 2313 states and 3315 transitions. Second operand has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 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-03-08 09:44:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:34,886 INFO L93 Difference]: Finished difference Result 4913 states and 7042 transitions. [2025-03-08 09:44:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 09:44:34,886 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 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-03-08 09:44:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:34,888 INFO L225 Difference]: With dead ends: 4913 [2025-03-08 09:44:34,888 INFO L226 Difference]: Without dead ends: 2683 [2025-03-08 09:44:34,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:44:34,890 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 41 mSDsluCounter, 12690 mSDsCounter, 0 mSdLazyCounter, 3185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 13602 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:34,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 13602 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3185 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 09:44:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2025-03-08 09:44:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2655. [2025-03-08 09:44:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2654 states have (on average 1.437452901281085) internal successors, (3815), 2654 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3815 transitions. [2025-03-08 09:44:34,906 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3815 transitions. Word has length 166 [2025-03-08 09:44:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:34,906 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 3815 transitions. [2025-03-08 09:44:34,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 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-03-08 09:44:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3815 transitions. [2025-03-08 09:44:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 09:44:34,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:34,907 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-03-08 09:44:34,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 09:44:34,907 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:34,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1378247954, now seen corresponding path program 1 times [2025-03-08 09:44:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:34,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979316281] [2025-03-08 09:44:34,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:34,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:34,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 09:44:35,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 09:44:35,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:35,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979316281] [2025-03-08 09:44:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979316281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:35,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:35,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 09:44:35,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002474592] [2025-03-08 09:44:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:35,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 09:44:35,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:35,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 09:44:35,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:44:35,530 INFO L87 Difference]: Start difference. First operand 2655 states and 3815 transitions. Second operand has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 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-03-08 09:44:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:36,326 INFO L93 Difference]: Finished difference Result 5287 states and 7598 transitions. [2025-03-08 09:44:36,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 09:44:36,326 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 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-03-08 09:44:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:36,328 INFO L225 Difference]: With dead ends: 5287 [2025-03-08 09:44:36,328 INFO L226 Difference]: Without dead ends: 2715 [2025-03-08 09:44:36,330 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-03-08 09:44:36,330 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-03-08 09:44:36,331 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-03-08 09:44:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-03-08 09:44:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2675. [2025-03-08 09:44:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2674 states have (on average 1.4386686611817503) internal successors, (3847), 2674 states have internal predecessors, (3847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3847 transitions. [2025-03-08 09:44:36,346 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3847 transitions. Word has length 167 [2025-03-08 09:44:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:36,346 INFO L471 AbstractCegarLoop]: Abstraction has 2675 states and 3847 transitions. [2025-03-08 09:44:36,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 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-03-08 09:44:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3847 transitions. [2025-03-08 09:44:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 09:44:36,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:36,347 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-03-08 09:44:36,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 09:44:36,347 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:36,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:36,347 INFO L85 PathProgramCache]: Analyzing trace with hash -353955768, now seen corresponding path program 1 times [2025-03-08 09:44:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:36,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957741012] [2025-03-08 09:44:36,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:36,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:36,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 09:44:36,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 09:44:36,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:36,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:36,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:36,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957741012] [2025-03-08 09:44:36,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957741012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:36,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:36,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479095786] [2025-03-08 09:44:36,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:36,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:36,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:36,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:36,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:36,846 INFO L87 Difference]: Start difference. First operand 2675 states and 3847 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-03-08 09:44:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:37,178 INFO L93 Difference]: Finished difference Result 5183 states and 7446 transitions. [2025-03-08 09:44:37,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:37,178 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-03-08 09:44:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:37,180 INFO L225 Difference]: With dead ends: 5183 [2025-03-08 09:44:37,180 INFO L226 Difference]: Without dead ends: 2591 [2025-03-08 09:44:37,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-03-08 09:44:37,182 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1022 mSDsluCounter, 2609 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 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-03-08 09:44:37,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 3482 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:37,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-03-08 09:44:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2591. [2025-03-08 09:44:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 2590 states have (on average 1.4320463320463321) internal successors, (3709), 2590 states have internal predecessors, (3709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 3709 transitions. [2025-03-08 09:44:37,200 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 3709 transitions. Word has length 167 [2025-03-08 09:44:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:37,200 INFO L471 AbstractCegarLoop]: Abstraction has 2591 states and 3709 transitions. [2025-03-08 09:44:37,200 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-03-08 09:44:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3709 transitions. [2025-03-08 09:44:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 09:44:37,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:37,201 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-03-08 09:44:37,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 09:44:37,202 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:37,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2082273093, now seen corresponding path program 1 times [2025-03-08 09:44:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:37,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929433035] [2025-03-08 09:44:37,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:37,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:37,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 09:44:37,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 09:44:37,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:37,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:37,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:37,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929433035] [2025-03-08 09:44:37,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929433035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:37,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:37,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:37,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996402042] [2025-03-08 09:44:37,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:37,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:37,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:37,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:37,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:37,612 INFO L87 Difference]: Start difference. First operand 2591 states and 3709 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 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-03-08 09:44:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:37,872 INFO L93 Difference]: Finished difference Result 5125 states and 7334 transitions. [2025-03-08 09:44:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:37,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 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-03-08 09:44:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:37,874 INFO L225 Difference]: With dead ends: 5125 [2025-03-08 09:44:37,874 INFO L226 Difference]: Without dead ends: 2617 [2025-03-08 09:44:37,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:37,875 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 941 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:37,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 2607 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:44:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2025-03-08 09:44:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2617. [2025-03-08 09:44:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2617 states, 2616 states have (on average 1.4292813455657492) internal successors, (3739), 2616 states have internal predecessors, (3739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 3739 transitions. [2025-03-08 09:44:37,890 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 3739 transitions. Word has length 167 [2025-03-08 09:44:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:37,890 INFO L471 AbstractCegarLoop]: Abstraction has 2617 states and 3739 transitions. [2025-03-08 09:44:37,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 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-03-08 09:44:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 3739 transitions. [2025-03-08 09:44:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 09:44:37,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:37,892 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-03-08 09:44:37,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 09:44:37,892 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:37,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 865685584, now seen corresponding path program 1 times [2025-03-08 09:44:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514904994] [2025-03-08 09:44:37,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:37,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 09:44:38,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 09:44:38,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:38,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:38,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:38,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514904994] [2025-03-08 09:44:38,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514904994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:38,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:38,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 09:44:38,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890358393] [2025-03-08 09:44:38,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:38,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 09:44:38,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:38,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 09:44:38,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:44:38,364 INFO L87 Difference]: Start difference. First operand 2617 states and 3739 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 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-03-08 09:44:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:39,002 INFO L93 Difference]: Finished difference Result 5033 states and 7184 transitions. [2025-03-08 09:44:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:44:39,003 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 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-03-08 09:44:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:39,004 INFO L225 Difference]: With dead ends: 5033 [2025-03-08 09:44:39,004 INFO L226 Difference]: Without dead ends: 2499 [2025-03-08 09:44:39,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:44:39,007 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 12 mSDsluCounter, 7958 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8845 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:39,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8845 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:44:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2025-03-08 09:44:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2493. [2025-03-08 09:44:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2492 states have (on average 1.4273675762439808) internal successors, (3557), 2492 states have internal predecessors, (3557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 3557 transitions. [2025-03-08 09:44:39,023 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 3557 transitions. Word has length 167 [2025-03-08 09:44:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:39,023 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 3557 transitions. [2025-03-08 09:44:39,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 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-03-08 09:44:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3557 transitions. [2025-03-08 09:44:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 09:44:39,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:39,025 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-03-08 09:44:39,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 09:44:39,025 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:39,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash 34997129, now seen corresponding path program 1 times [2025-03-08 09:44:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:39,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415627956] [2025-03-08 09:44:39,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:39,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 09:44:39,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 09:44:39,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:39,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:39,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:39,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415627956] [2025-03-08 09:44:39,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415627956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:39,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:39,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151095173] [2025-03-08 09:44:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:39,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:39,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:39,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:39,366 INFO L87 Difference]: Start difference. First operand 2493 states and 3557 transitions. Second operand has 5 states, 5 states have (on average 33.6) 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-03-08 09:44:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:39,961 INFO L93 Difference]: Finished difference Result 5904 states and 8403 transitions. [2025-03-08 09:44:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:39,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) 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-03-08 09:44:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:39,964 INFO L225 Difference]: With dead ends: 5904 [2025-03-08 09:44:39,964 INFO L226 Difference]: Without dead ends: 3494 [2025-03-08 09:44:39,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:39,966 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 1777 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:39,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 2038 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:44:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2025-03-08 09:44:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 2500. [2025-03-08 09:44:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2499 states have (on average 1.4269707883153262) internal successors, (3566), 2499 states have internal predecessors, (3566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3566 transitions. [2025-03-08 09:44:39,985 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3566 transitions. Word has length 168 [2025-03-08 09:44:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:39,985 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3566 transitions. [2025-03-08 09:44:39,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) 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-03-08 09:44:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3566 transitions. [2025-03-08 09:44:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 09:44:39,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:39,986 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-03-08 09:44:39,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 09:44:39,987 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:39,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1275606163, now seen corresponding path program 1 times [2025-03-08 09:44:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:39,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966838382] [2025-03-08 09:44:39,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:40,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 09:44:40,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 09:44:40,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:40,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:40,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:40,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966838382] [2025-03-08 09:44:40,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966838382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:40,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 09:44:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434741431] [2025-03-08 09:44:40,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:40,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 09:44:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:40,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 09:44:40,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:44:40,841 INFO L87 Difference]: Start difference. First operand 2500 states and 3566 transitions. Second operand has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 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-03-08 09:44:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:41,909 INFO L93 Difference]: Finished difference Result 5042 states and 7191 transitions. [2025-03-08 09:44:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 09:44:41,910 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 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-03-08 09:44:41,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:41,911 INFO L225 Difference]: With dead ends: 5042 [2025-03-08 09:44:41,911 INFO L226 Difference]: Without dead ends: 2632 [2025-03-08 09:44:41,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:44:41,913 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 33 mSDsluCounter, 13205 mSDsCounter, 0 mSdLazyCounter, 3298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 14091 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:41,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 14091 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3298 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 09:44:41,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2025-03-08 09:44:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2592. [2025-03-08 09:44:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2591 states have (on average 1.4303357776920107) internal successors, (3706), 2591 states have internal predecessors, (3706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 3706 transitions. [2025-03-08 09:44:41,929 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 3706 transitions. Word has length 168 [2025-03-08 09:44:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:41,929 INFO L471 AbstractCegarLoop]: Abstraction has 2592 states and 3706 transitions. [2025-03-08 09:44:41,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 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-03-08 09:44:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3706 transitions. [2025-03-08 09:44:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 09:44:41,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:41,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] [2025-03-08 09:44:41,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 09:44:41,930 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:41,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1788396323, now seen corresponding path program 1 times [2025-03-08 09:44:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56016774] [2025-03-08 09:44:41,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:41,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 09:44:42,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 09:44:42,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:42,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:42,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:42,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56016774] [2025-03-08 09:44:42,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56016774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:42,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:42,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:42,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273822777] [2025-03-08 09:44:42,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:42,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:42,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:42,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:42,358 INFO L87 Difference]: Start difference. First operand 2592 states and 3706 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 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-03-08 09:44:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:42,772 INFO L93 Difference]: Finished difference Result 5142 states and 7355 transitions. [2025-03-08 09:44:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:44:42,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 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-03-08 09:44:42,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:42,774 INFO L225 Difference]: With dead ends: 5142 [2025-03-08 09:44:42,774 INFO L226 Difference]: Without dead ends: 2640 [2025-03-08 09:44:42,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-03-08 09:44:42,776 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 999 mSDsluCounter, 3478 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 4351 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-03-08 09:44:42,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 4351 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:44:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2025-03-08 09:44:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2640. [2025-03-08 09:44:42,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 1.427055702917772) internal successors, (3766), 2639 states have internal predecessors, (3766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3766 transitions. [2025-03-08 09:44:42,798 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3766 transitions. Word has length 168 [2025-03-08 09:44:42,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:42,799 INFO L471 AbstractCegarLoop]: Abstraction has 2640 states and 3766 transitions. [2025-03-08 09:44:42,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 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-03-08 09:44:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3766 transitions. [2025-03-08 09:44:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 09:44:42,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:42,801 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-03-08 09:44:42,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 09:44:42,801 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:42,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:42,802 INFO L85 PathProgramCache]: Analyzing trace with hash 908561702, now seen corresponding path program 1 times [2025-03-08 09:44:42,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:42,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459524577] [2025-03-08 09:44:42,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:42,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:42,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 09:44:42,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 09:44:42,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:42,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:43,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459524577] [2025-03-08 09:44:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459524577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:43,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:43,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174737581] [2025-03-08 09:44:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:43,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:43,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:43,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:43,283 INFO L87 Difference]: Start difference. First operand 2640 states and 3766 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 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-03-08 09:44:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:43,573 INFO L93 Difference]: Finished difference Result 5258 states and 7503 transitions. [2025-03-08 09:44:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:43,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 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-03-08 09:44:43,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:43,576 INFO L225 Difference]: With dead ends: 5258 [2025-03-08 09:44:43,576 INFO L226 Difference]: Without dead ends: 2708 [2025-03-08 09:44:43,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:43,578 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 985 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:43,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 2602 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2025-03-08 09:44:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2025-03-08 09:44:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2707 states have (on average 1.4207609900258589) internal successors, (3846), 2707 states have internal predecessors, (3846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3846 transitions. [2025-03-08 09:44:43,594 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3846 transitions. Word has length 169 [2025-03-08 09:44:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:43,595 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 3846 transitions. [2025-03-08 09:44:43,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 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-03-08 09:44:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3846 transitions. [2025-03-08 09:44:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 09:44:43,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:43,609 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-03-08 09:44:43,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 09:44:43,609 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:43,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1798793179, now seen corresponding path program 1 times [2025-03-08 09:44:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:43,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590478626] [2025-03-08 09:44:43,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:43,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:43,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 09:44:43,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 09:44:43,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:43,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:45,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:45,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590478626] [2025-03-08 09:44:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590478626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:45,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:45,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-08 09:44:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837126984] [2025-03-08 09:44:45,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:45,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 09:44:45,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:45,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 09:44:45,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2025-03-08 09:44:45,129 INFO L87 Difference]: Start difference. First operand 2708 states and 3846 transitions. Second operand has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 28 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-03-08 09:44:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:47,599 INFO L93 Difference]: Finished difference Result 5613 states and 7963 transitions. [2025-03-08 09:44:47,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 09:44:47,599 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 28 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-03-08 09:44:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:47,602 INFO L225 Difference]: With dead ends: 5613 [2025-03-08 09:44:47,602 INFO L226 Difference]: Without dead ends: 2995 [2025-03-08 09:44:47,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=1984, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 09:44:47,604 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 1421 mSDsluCounter, 20033 mSDsCounter, 0 mSdLazyCounter, 6075 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 20869 SdHoareTripleChecker+Invalid, 6091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 6075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:47,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 20869 Invalid, 6091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 6075 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 09:44:47,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2025-03-08 09:44:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2982. [2025-03-08 09:44:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2981 states have (on average 1.4196578329419658) internal successors, (4232), 2981 states have internal predecessors, (4232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 4232 transitions. [2025-03-08 09:44:47,620 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 4232 transitions. Word has length 169 [2025-03-08 09:44:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:47,620 INFO L471 AbstractCegarLoop]: Abstraction has 2982 states and 4232 transitions. [2025-03-08 09:44:47,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 28 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-03-08 09:44:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 4232 transitions. [2025-03-08 09:44:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 09:44:47,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:47,622 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-03-08 09:44:47,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 09:44:47,622 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:47,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash 523885779, now seen corresponding path program 1 times [2025-03-08 09:44:47,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:47,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290238697] [2025-03-08 09:44:47,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:47,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:47,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 09:44:47,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 09:44:47,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:47,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:48,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:48,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290238697] [2025-03-08 09:44:48,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290238697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:48,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:48,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:48,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279676591] [2025-03-08 09:44:48,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:48,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:48,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:48,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:48,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:48,011 INFO L87 Difference]: Start difference. First operand 2982 states and 4232 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 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-03-08 09:44:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:48,539 INFO L93 Difference]: Finished difference Result 6837 states and 9680 transitions. [2025-03-08 09:44:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 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-03-08 09:44:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:48,543 INFO L225 Difference]: With dead ends: 6837 [2025-03-08 09:44:48,543 INFO L226 Difference]: Without dead ends: 3945 [2025-03-08 09:44:48,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:48,545 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 1715 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:48,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 2038 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:44:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2025-03-08 09:44:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3347. [2025-03-08 09:44:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3347 states, 3346 states have (on average 1.4178123132098028) internal successors, (4744), 3346 states have internal predecessors, (4744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 4744 transitions. [2025-03-08 09:44:48,566 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 4744 transitions. Word has length 169 [2025-03-08 09:44:48,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:48,566 INFO L471 AbstractCegarLoop]: Abstraction has 3347 states and 4744 transitions. [2025-03-08 09:44:48,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 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-03-08 09:44:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 4744 transitions. [2025-03-08 09:44:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 09:44:48,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:48,568 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-03-08 09:44:48,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 09:44:48,568 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:48,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash 328079472, now seen corresponding path program 1 times [2025-03-08 09:44:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:48,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305057116] [2025-03-08 09:44:48,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:48,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:48,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 09:44:48,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 09:44:48,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:48,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:49,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:49,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305057116] [2025-03-08 09:44:49,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305057116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:49,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:49,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:44:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839220075] [2025-03-08 09:44:49,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:49,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:44:49,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:49,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:44:49,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:44:49,476 INFO L87 Difference]: Start difference. First operand 3347 states and 4744 transitions. Second operand has 20 states, 20 states have (on average 8.5) internal successors, (170), 20 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:50,832 INFO L93 Difference]: Finished difference Result 6239 states and 8839 transitions. [2025-03-08 09:44:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 09:44:50,832 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.5) internal successors, (170), 20 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-03-08 09:44:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:50,835 INFO L225 Difference]: With dead ends: 6239 [2025-03-08 09:44:50,835 INFO L226 Difference]: Without dead ends: 3347 [2025-03-08 09:44:50,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:44:50,837 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 74 mSDsluCounter, 15617 mSDsCounter, 0 mSdLazyCounter, 3979 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 16487 SdHoareTripleChecker+Invalid, 3988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:50,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 16487 Invalid, 3988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3979 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 09:44:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2025-03-08 09:44:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3317. [2025-03-08 09:44:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.416767189384801) internal successors, (4698), 3316 states have internal predecessors, (4698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4698 transitions. [2025-03-08 09:44:50,857 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4698 transitions. Word has length 170 [2025-03-08 09:44:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:50,857 INFO L471 AbstractCegarLoop]: Abstraction has 3317 states and 4698 transitions. [2025-03-08 09:44:50,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.5) internal successors, (170), 20 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4698 transitions. [2025-03-08 09:44:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 09:44:50,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:50,859 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-03-08 09:44:50,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 09:44:50,859 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:50,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:50,859 INFO L85 PathProgramCache]: Analyzing trace with hash 505358662, now seen corresponding path program 1 times [2025-03-08 09:44:50,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:50,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844332086] [2025-03-08 09:44:50,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:50,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:50,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 09:44:51,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 09:44:51,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:51,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:51,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:51,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844332086] [2025-03-08 09:44:51,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844332086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:51,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:51,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:51,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464941355] [2025-03-08 09:44:51,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:51,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:51,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:51,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:51,778 INFO L87 Difference]: Start difference. First operand 3317 states and 4698 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:52,143 INFO L93 Difference]: Finished difference Result 6581 states and 9321 transitions. [2025-03-08 09:44:52,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:44:52,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-03-08 09:44:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:52,146 INFO L225 Difference]: With dead ends: 6581 [2025-03-08 09:44:52,146 INFO L226 Difference]: Without dead ends: 3338 [2025-03-08 09:44:52,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-03-08 09:44:52,148 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 1049 mSDsluCounter, 3542 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 4433 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:52,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 4433 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:52,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2025-03-08 09:44:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3335. [2025-03-08 09:44:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 3334 states have (on average 1.4154169166166766) internal successors, (4719), 3334 states have internal predecessors, (4719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4719 transitions. [2025-03-08 09:44:52,165 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4719 transitions. Word has length 170 [2025-03-08 09:44:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:52,165 INFO L471 AbstractCegarLoop]: Abstraction has 3335 states and 4719 transitions. [2025-03-08 09:44:52,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4719 transitions. [2025-03-08 09:44:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 09:44:52,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:52,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:52,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 09:44:52,167 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:52,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash 235934531, now seen corresponding path program 1 times [2025-03-08 09:44:52,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:52,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853530320] [2025-03-08 09:44:52,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:52,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:52,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 09:44:52,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 09:44:52,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:52,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853530320] [2025-03-08 09:44:52,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853530320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:52,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:52,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882016317] [2025-03-08 09:44:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:52,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:52,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:52,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:52,484 INFO L87 Difference]: Start difference. First operand 3335 states and 4719 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:52,849 INFO L93 Difference]: Finished difference Result 7294 states and 10310 transitions. [2025-03-08 09:44:52,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:52,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-03-08 09:44:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:52,853 INFO L225 Difference]: With dead ends: 7294 [2025-03-08 09:44:52,853 INFO L226 Difference]: Without dead ends: 4033 [2025-03-08 09:44:52,855 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-03-08 09:44:52,855 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 2098 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2098 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:52,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2098 Valid, 2545 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2025-03-08 09:44:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 3330. [2025-03-08 09:44:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3330 states, 3329 states have (on average 1.414839291078402) internal successors, (4710), 3329 states have internal predecessors, (4710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 4710 transitions. [2025-03-08 09:44:52,874 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 4710 transitions. Word has length 171 [2025-03-08 09:44:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:52,874 INFO L471 AbstractCegarLoop]: Abstraction has 3330 states and 4710 transitions. [2025-03-08 09:44:52,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 4710 transitions. [2025-03-08 09:44:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 09:44:52,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:52,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:52,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-08 09:44:52,876 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:52,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1784526067, now seen corresponding path program 1 times [2025-03-08 09:44:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975167274] [2025-03-08 09:44:52,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:52,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 09:44:53,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 09:44:53,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:53,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:44:53,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:44:53,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 09:44:53,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 09:44:53,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:53,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:44:53,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:44:53,302 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:44:53,303 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:44:53,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-08 09:44:53,306 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] [2025-03-08 09:44:53,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:44:53,417 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:44:53,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:44:53 BoogieIcfgContainer [2025-03-08 09:44:53,420 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:44:53,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:44:53,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:44:53,421 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:44:53,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:43:48" (3/4) ... [2025-03-08 09:44:53,423 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:44:53,423 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:44:53,424 INFO L158 Benchmark]: Toolchain (without parser) took 67883.88ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 111.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. [2025-03-08 09:44:53,424 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:44:53,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.62ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 58.5MB in the end (delta: 52.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 09:44:53,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 235.38ms. Allocated memory is still 142.6MB. Free memory was 58.5MB in the beginning and 56.6MB in the end (delta: 1.9MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2025-03-08 09:44:53,427 INFO L158 Benchmark]: Boogie Preprocessor took 258.70ms. Allocated memory is still 142.6MB. Free memory was 56.6MB in the beginning and 48.2MB in the end (delta: 8.4MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2025-03-08 09:44:53,427 INFO L158 Benchmark]: IcfgBuilder took 2357.43ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 48.2MB in the beginning and 69.6MB in the end (delta: -21.4MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2025-03-08 09:44:53,427 INFO L158 Benchmark]: TraceAbstraction took 64527.25ms. Allocated memory was 285.2MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 69.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2025-03-08 09:44:53,427 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 80.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:44:53,427 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.62ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 58.5MB in the end (delta: 52.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 235.38ms. Allocated memory is still 142.6MB. Free memory was 58.5MB in the beginning and 56.6MB in the end (delta: 1.9MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 258.70ms. Allocated memory is still 142.6MB. Free memory was 56.6MB in the beginning and 48.2MB in the end (delta: 8.4MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * IcfgBuilder took 2357.43ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 48.2MB in the beginning and 69.6MB in the end (delta: -21.4MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. * TraceAbstraction took 64527.25ms. Allocated memory was 285.2MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 69.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 80.9kB). There was no memory consumed. 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 355, overapproximation of bitwiseAnd at line 232, overapproximation of bitwiseAnd at line 308, overapproximation of bitwiseAnd at line 428, overapproximation of bitwiseAnd at line 402, overapproximation of bitwiseAnd at line 261. 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, 723 locations, 1081 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.4s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 31.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29360 SdHoareTripleChecker+Valid, 29.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29360 mSDsluCounter, 332055 SdHoareTripleChecker+Invalid, 24.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281804 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79890 IncrementalHoareTripleChecker+Invalid, 79982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 50251 mSDtfsCounter, 79890 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 596 GetRequests, 163 SyntacticMatches, 12 SemanticMatches, 421 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3347occurred in iteration=54, InterpolantAutomatonStates: 450, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 57 MinimizatonAttempts, 5314 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 9220 NumberOfCodeBlocks, 9220 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 8992 ConstructedInterpolants, 0 QuantifiedInterpolants, 20496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 57 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-03-08 09:44:53,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-08 09:44:55,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:44:55,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:44:55,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:44:55,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:44:55,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:44:55,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:44:55,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:44:55,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:44:55,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:44:55,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:44:55,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:44:55,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:44:55,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:44:55,420 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:44:55,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:44:55,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:44:55,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:44:55,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:44:55,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:44:55,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:44:55,421 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:44:55,421 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:44:55,421 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:44:55,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:44:55,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:44:55,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:44:55,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:44:55,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:44:55,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:44:55,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:44:55,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:44:55,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:44:55,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:44:55,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:44:55,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:44:55,422 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:44:55,423 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:44:55,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:44:55,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:44:55,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:44:55,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:44:55,423 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/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-03-08 09:44:55,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:44:55,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:44:55,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:44:55,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:44:55,685 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:44:55,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-08 09:44:56,810 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b859ec17d/f7f7fc92212d41b6a246cc03f74f4951/FLAG1898906f2 [2025-03-08 09:44:57,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:44:57,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-08 09:44:57,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b859ec17d/f7f7fc92212d41b6a246cc03f74f4951/FLAG1898906f2 [2025-03-08 09:44:57,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b859ec17d/f7f7fc92212d41b6a246cc03f74f4951 [2025-03-08 09:44:57,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:44:57,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:44:57,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:44:57,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:44:57,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:44:57,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:57,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab6e30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57, skipping insertion in model container [2025-03-08 09:44:57,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:57,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:44:57,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c[1259,1272] [2025-03-08 09:44:57,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:44:57,730 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:44:57,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c[1259,1272] [2025-03-08 09:44:57,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:44:57,833 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:44:57,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57 WrapperNode [2025-03-08 09:44:57,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:44:57,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:44:57,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:44:57,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:44:57,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:57,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:57,952 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1325 [2025-03-08 09:44:57,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:44:57,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:44:57,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:44:57,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:44:57,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:57,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:58,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:58,027 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-03-08 09:44:58,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:58,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:58,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:58,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:58,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:58,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:58,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:44:58,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:44:58,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:44:58,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:44:58,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:57" (1/1) ... [2025-03-08 09:44:58,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:44:58,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:44:58,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:44:58,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:44:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:44:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:44:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:44:58,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:44:58,419 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:44:58,420 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation