./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4fbb35f76027517819b7c383b61e34fa76a9ce203f76a516ef6e2a6ae9cf5da8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:19:56,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:19:56,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:19:56,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:19:56,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:19:56,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:19:56,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:19:56,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:19:56,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:19:56,785 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:19:56,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:19:56,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:19:56,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:19:56,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:19:56,787 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:19:56,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:19:56,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:19:56,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:19:56,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:19:56,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:19:56,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:19:56,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:19:56,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:19:56,788 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:19:56,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:19:56,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:19:56,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:19:56,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:19:56,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:19:56,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:56,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:19:56,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:19:56,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:19:56,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:19:56,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:56,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:19:56,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:19:56,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:19:56,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:19:56,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:19:56,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:19:56,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:19:56,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:19:56,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:19:56,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:19:56,790 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fbb35f76027517819b7c383b61e34fa76a9ce203f76a516ef6e2a6ae9cf5da8 [2025-01-09 08:19:57,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:19:57,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:19:57,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:19:57,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:19:57,013 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:19:57,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-01-09 08:19:58,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8792cfdb8/84ff00f81c124b1fa733063c26d3d409/FLAGfb7fce0b4 [2025-01-09 08:19:58,614 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:19:58,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-01-09 08:19:58,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8792cfdb8/84ff00f81c124b1fa733063c26d3d409/FLAGfb7fce0b4 [2025-01-09 08:19:58,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8792cfdb8/84ff00f81c124b1fa733063c26d3d409 [2025-01-09 08:19:58,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:19:58,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:19:58,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:19:58,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:19:58,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:19:58,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:19:58" (1/1) ... [2025-01-09 08:19:58,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:58, skipping insertion in model container [2025-01-09 08:19:58,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:19:58" (1/1) ... [2025-01-09 08:19:58,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:19:59,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c[1258,1271] [2025-01-09 08:19:59,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:19:59,305 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:19:59,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c[1258,1271] [2025-01-09 08:19:59,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:19:59,510 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:19:59,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59 WrapperNode [2025-01-09 08:19:59,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:19:59,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:19:59,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:19:59,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:19:59,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:19:59,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:19:59,947 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4637 [2025-01-09 08:19:59,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:19:59,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:19:59,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:19:59,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:19:59,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:19:59,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:20:00,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:20:00,104 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:20:00,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:20:00,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:20:00,246 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:20:00,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:20:00,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:20:00,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:20:00,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:20:00,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:20:00,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:20:00,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:20:00,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:20:00,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (1/1) ... [2025-01-09 08:20:00,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:00,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:00,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:20:00,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:20:00,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:20:00,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:20:00,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:20:00,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:20:00,792 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:20:00,793 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:20:03,693 INFO L? ?]: Removed 2911 outVars from TransFormulas that were not future-live. [2025-01-09 08:20:03,693 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:20:03,719 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:20:03,719 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:20:03,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:03 BoogieIcfgContainer [2025-01-09 08:20:03,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:20:03,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:20:03,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:20:03,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:20:03,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:19:58" (1/3) ... [2025-01-09 08:20:03,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff44306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:20:03, skipping insertion in model container [2025-01-09 08:20:03,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:59" (2/3) ... [2025-01-09 08:20:03,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff44306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:20:03, skipping insertion in model container [2025-01-09 08:20:03,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:03" (3/3) ... [2025-01-09 08:20:03,728 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-01-09 08:20:03,737 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:20:03,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_bpbs_p2.c that has 1 procedures, 1154 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:20:03,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:20:03,801 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;@776a416c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:20:03,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:20:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 1154 states, 1152 states have (on average 1.4991319444444444) internal successors, (1727), 1153 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-01-09 08:20:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 08:20:03,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:03,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:03,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:03,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1723682278, now seen corresponding path program 1 times [2025-01-09 08:20:03,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:03,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190601584] [2025-01-09 08:20:03,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:03,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:03,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 08:20:04,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 08:20:04,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:04,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:05,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190601584] [2025-01-09 08:20:05,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190601584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:05,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:05,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:05,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358703846] [2025-01-09 08:20:05,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:05,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:05,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:05,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:05,216 INFO L87 Difference]: Start difference. First operand has 1154 states, 1152 states have (on average 1.4991319444444444) internal successors, (1727), 1153 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) Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:05,365 INFO L93 Difference]: Finished difference Result 2165 states and 3243 transitions. [2025-01-09 08:20:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:05,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2025-01-09 08:20:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:05,388 INFO L225 Difference]: With dead ends: 2165 [2025-01-09 08:20:05,388 INFO L226 Difference]: Without dead ends: 1153 [2025-01-09 08:20:05,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:05,396 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5157 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:05,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5157 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-01-09 08:20:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2025-01-09 08:20:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.4973958333333333) internal successors, (1725), 1152 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1725 transitions. [2025-01-09 08:20:05,461 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1725 transitions. Word has length 195 [2025-01-09 08:20:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:05,462 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1725 transitions. [2025-01-09 08:20:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1725 transitions. [2025-01-09 08:20:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 08:20:05,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:05,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:05,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:20:05,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:05,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1896239454, now seen corresponding path program 1 times [2025-01-09 08:20:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:05,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547133221] [2025-01-09 08:20:05,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:05,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:05,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 08:20:05,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 08:20:05,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:05,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:05,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:05,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547133221] [2025-01-09 08:20:05,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547133221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:05,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:05,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:05,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133578729] [2025-01-09 08:20:05,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:05,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:05,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:05,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:05,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:05,991 INFO L87 Difference]: Start difference. First operand 1153 states and 1725 transitions. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:06,049 INFO L93 Difference]: Finished difference Result 2166 states and 3241 transitions. [2025-01-09 08:20:06,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:06,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2025-01-09 08:20:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:06,055 INFO L225 Difference]: With dead ends: 2166 [2025-01-09 08:20:06,055 INFO L226 Difference]: Without dead ends: 1155 [2025-01-09 08:20:06,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:06,059 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5153 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:06,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5153 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-01-09 08:20:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2025-01-09 08:20:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.4965337954939342) internal successors, (1727), 1154 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-01-09 08:20:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1727 transitions. [2025-01-09 08:20:06,089 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1727 transitions. Word has length 196 [2025-01-09 08:20:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:06,090 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1727 transitions. [2025-01-09 08:20:06,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1727 transitions. [2025-01-09 08:20:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 08:20:06,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:06,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:06,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:20:06,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:06,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1850883519, now seen corresponding path program 1 times [2025-01-09 08:20:06,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:06,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839283161] [2025-01-09 08:20:06,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:06,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:06,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:20:06,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:20:06,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:06,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:06,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:06,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839283161] [2025-01-09 08:20:06,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839283161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:06,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:06,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078633215] [2025-01-09 08:20:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:06,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:06,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:06,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:06,969 INFO L87 Difference]: Start difference. First operand 1155 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:07,066 INFO L93 Difference]: Finished difference Result 2176 states and 3254 transitions. [2025-01-09 08:20:07,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:07,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2025-01-09 08:20:07,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:07,072 INFO L225 Difference]: With dead ends: 2176 [2025-01-09 08:20:07,072 INFO L226 Difference]: Without dead ends: 1163 [2025-01-09 08:20:07,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:07,076 INFO L435 NwaCegarLoop]: 1717 mSDtfsCounter, 6 mSDsluCounter, 5142 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6859 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:07,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6859 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2025-01-09 08:20:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2025-01-09 08:20:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1160 states have (on average 1.4956896551724137) internal successors, (1735), 1160 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1735 transitions. [2025-01-09 08:20:07,103 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1735 transitions. Word has length 197 [2025-01-09 08:20:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:07,104 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1735 transitions. [2025-01-09 08:20:07,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1735 transitions. [2025-01-09 08:20:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 08:20:07,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:07,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:07,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:20:07,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:07,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash 131761531, now seen corresponding path program 1 times [2025-01-09 08:20:07,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:07,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940121325] [2025-01-09 08:20:07,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:07,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 08:20:07,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 08:20:07,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:07,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940121325] [2025-01-09 08:20:07,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940121325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:07,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:07,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:07,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528225674] [2025-01-09 08:20:07,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:07,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:07,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:07,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:07,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:07,957 INFO L87 Difference]: Start difference. First operand 1161 states and 1735 transitions. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:08,111 INFO L93 Difference]: Finished difference Result 2188 states and 3270 transitions. [2025-01-09 08:20:08,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:08,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2025-01-09 08:20:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:08,141 INFO L225 Difference]: With dead ends: 2188 [2025-01-09 08:20:08,141 INFO L226 Difference]: Without dead ends: 1169 [2025-01-09 08:20:08,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:08,145 INFO L435 NwaCegarLoop]: 1717 mSDtfsCounter, 6 mSDsluCounter, 5142 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6859 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:08,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6859 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-01-09 08:20:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1167. [2025-01-09 08:20:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1166 states have (on average 1.4948542024013722) internal successors, (1743), 1166 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1743 transitions. [2025-01-09 08:20:08,194 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1743 transitions. Word has length 198 [2025-01-09 08:20:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:08,194 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1743 transitions. [2025-01-09 08:20:08,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1743 transitions. [2025-01-09 08:20:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 08:20:08,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:08,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:08,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:20:08,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:08,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1174984752, now seen corresponding path program 1 times [2025-01-09 08:20:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:08,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320482411] [2025-01-09 08:20:08,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:08,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 08:20:08,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 08:20:08,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:08,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:08,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:08,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320482411] [2025-01-09 08:20:08,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320482411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:08,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:08,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:08,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582161172] [2025-01-09 08:20:08,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:08,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:08,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:08,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:08,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:08,600 INFO L87 Difference]: Start difference. First operand 1167 states and 1743 transitions. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:08,656 INFO L93 Difference]: Finished difference Result 2198 states and 3283 transitions. [2025-01-09 08:20:08,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:08,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-01-09 08:20:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:08,661 INFO L225 Difference]: With dead ends: 2198 [2025-01-09 08:20:08,661 INFO L226 Difference]: Without dead ends: 1173 [2025-01-09 08:20:08,662 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-01-09 08:20:08,662 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 4 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6868 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:08,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6868 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2025-01-09 08:20:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2025-01-09 08:20:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.4940273037542662) internal successors, (1751), 1172 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1751 transitions. [2025-01-09 08:20:08,680 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1751 transitions. Word has length 199 [2025-01-09 08:20:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:08,680 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1751 transitions. [2025-01-09 08:20:08,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1751 transitions. [2025-01-09 08:20:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 08:20:08,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:08,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:08,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:20:08,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:08,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:08,683 INFO L85 PathProgramCache]: Analyzing trace with hash 921244350, now seen corresponding path program 1 times [2025-01-09 08:20:08,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:08,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766492840] [2025-01-09 08:20:08,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:08,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:08,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 08:20:08,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 08:20:08,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:08,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:09,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:09,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766492840] [2025-01-09 08:20:09,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766492840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:09,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:09,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062617457] [2025-01-09 08:20:09,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:09,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:09,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:09,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:09,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:09,637 INFO L87 Difference]: Start difference. First operand 1173 states and 1751 transitions. Second operand has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:09,841 INFO L93 Difference]: Finished difference Result 2212 states and 3302 transitions. [2025-01-09 08:20:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:09,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-01-09 08:20:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:09,845 INFO L225 Difference]: With dead ends: 2212 [2025-01-09 08:20:09,845 INFO L226 Difference]: Without dead ends: 1181 [2025-01-09 08:20:09,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:09,848 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1631 mSDsluCounter, 5056 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 6744 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:09,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 6744 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-01-09 08:20:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1178. [2025-01-09 08:20:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.4927782497875957) internal successors, (1757), 1177 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1757 transitions. [2025-01-09 08:20:09,870 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1757 transitions. Word has length 199 [2025-01-09 08:20:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:09,871 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1757 transitions. [2025-01-09 08:20:09,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1757 transitions. [2025-01-09 08:20:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 08:20:09,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:09,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:09,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:20:09,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:09,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1206567956, now seen corresponding path program 1 times [2025-01-09 08:20:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709753488] [2025-01-09 08:20:09,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:09,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 08:20:09,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 08:20:09,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:09,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:10,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:10,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709753488] [2025-01-09 08:20:10,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709753488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:10,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:10,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:10,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955167155] [2025-01-09 08:20:10,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:10,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:10,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:10,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:10,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:10,556 INFO L87 Difference]: Start difference. First operand 1178 states and 1757 transitions. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:10,652 INFO L93 Difference]: Finished difference Result 2252 states and 3357 transitions. [2025-01-09 08:20:10,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:10,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2025-01-09 08:20:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:10,658 INFO L225 Difference]: With dead ends: 2252 [2025-01-09 08:20:10,658 INFO L226 Difference]: Without dead ends: 1216 [2025-01-09 08:20:10,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:10,660 INFO L435 NwaCegarLoop]: 1713 mSDtfsCounter, 30 mSDsluCounter, 8587 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 10300 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:10,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 10300 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-01-09 08:20:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1212. [2025-01-09 08:20:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 1.4913294797687862) internal successors, (1806), 1211 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1806 transitions. [2025-01-09 08:20:10,679 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1806 transitions. Word has length 200 [2025-01-09 08:20:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:10,679 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1806 transitions. [2025-01-09 08:20:10,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1806 transitions. [2025-01-09 08:20:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 08:20:10,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:10,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:10,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:20:10,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:10,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:10,682 INFO L85 PathProgramCache]: Analyzing trace with hash 737650565, now seen corresponding path program 1 times [2025-01-09 08:20:10,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688696704] [2025-01-09 08:20:10,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:10,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 08:20:10,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 08:20:10,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:10,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:11,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:11,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688696704] [2025-01-09 08:20:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688696704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:11,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:11,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296088550] [2025-01-09 08:20:11,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:11,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:11,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:11,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:11,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:11,513 INFO L87 Difference]: Start difference. First operand 1212 states and 1806 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:11,650 INFO L93 Difference]: Finished difference Result 2293 states and 3417 transitions. [2025-01-09 08:20:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2025-01-09 08:20:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:11,660 INFO L225 Difference]: With dead ends: 2293 [2025-01-09 08:20:11,660 INFO L226 Difference]: Without dead ends: 1223 [2025-01-09 08:20:11,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:11,666 INFO L435 NwaCegarLoop]: 1717 mSDtfsCounter, 5 mSDsluCounter, 5142 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6859 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:11,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6859 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-01-09 08:20:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1220. [2025-01-09 08:20:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1219 states have (on average 1.4897456931911404) internal successors, (1816), 1219 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1816 transitions. [2025-01-09 08:20:11,712 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1816 transitions. Word has length 200 [2025-01-09 08:20:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:11,712 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1816 transitions. [2025-01-09 08:20:11,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1816 transitions. [2025-01-09 08:20:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 08:20:11,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:11,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:20:11,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:11,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:11,721 INFO L85 PathProgramCache]: Analyzing trace with hash 820875486, now seen corresponding path program 1 times [2025-01-09 08:20:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838549330] [2025-01-09 08:20:11,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:11,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 08:20:11,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 08:20:11,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:11,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:12,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838549330] [2025-01-09 08:20:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838549330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:12,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150987398] [2025-01-09 08:20:12,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:12,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:12,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:12,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:12,226 INFO L87 Difference]: Start difference. First operand 1220 states and 1816 transitions. Second operand has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:12,291 INFO L93 Difference]: Finished difference Result 2310 states and 3438 transitions. [2025-01-09 08:20:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:12,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2025-01-09 08:20:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:12,295 INFO L225 Difference]: With dead ends: 2310 [2025-01-09 08:20:12,295 INFO L226 Difference]: Without dead ends: 1232 [2025-01-09 08:20:12,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:12,299 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 4 mSDsluCounter, 6862 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8582 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:12,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8582 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2025-01-09 08:20:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2025-01-09 08:20:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 1.4882209585702681) internal successors, (1832), 1231 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1832 transitions. [2025-01-09 08:20:12,319 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1832 transitions. Word has length 200 [2025-01-09 08:20:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:12,319 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1832 transitions. [2025-01-09 08:20:12,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:12,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1832 transitions. [2025-01-09 08:20:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 08:20:12,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:12,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:12,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:20:12,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1180055284, now seen corresponding path program 1 times [2025-01-09 08:20:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585957987] [2025-01-09 08:20:12,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:12,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 08:20:12,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 08:20:12,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:12,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:12,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:12,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585957987] [2025-01-09 08:20:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585957987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:12,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:12,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:12,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041565617] [2025-01-09 08:20:12,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:12,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:12,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:12,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:12,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:12,734 INFO L87 Difference]: Start difference. First operand 1232 states and 1832 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:12,823 INFO L93 Difference]: Finished difference Result 2326 states and 3458 transitions. [2025-01-09 08:20:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-01-09 08:20:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:12,828 INFO L225 Difference]: With dead ends: 2326 [2025-01-09 08:20:12,829 INFO L226 Difference]: Without dead ends: 1236 [2025-01-09 08:20:12,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:12,830 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 5147 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6868 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:12,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6868 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2025-01-09 08:20:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1236. [2025-01-09 08:20:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.4866396761133602) internal successors, (1836), 1235 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1836 transitions. [2025-01-09 08:20:12,847 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1836 transitions. Word has length 201 [2025-01-09 08:20:12,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:12,848 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1836 transitions. [2025-01-09 08:20:12,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1836 transitions. [2025-01-09 08:20:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 08:20:12,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:12,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:12,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:20:12,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:12,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash -270288219, now seen corresponding path program 1 times [2025-01-09 08:20:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:12,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261326969] [2025-01-09 08:20:12,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:12,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:12,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 08:20:13,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 08:20:13,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:13,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:13,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261326969] [2025-01-09 08:20:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261326969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:13,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241805646] [2025-01-09 08:20:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:13,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:13,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:13,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:13,798 INFO L87 Difference]: Start difference. First operand 1236 states and 1836 transitions. Second operand has 7 states, 7 states have (on average 28.714285714285715) internal successors, (201), 7 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:13,997 INFO L93 Difference]: Finished difference Result 2338 states and 3472 transitions. [2025-01-09 08:20:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.714285714285715) internal successors, (201), 7 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-01-09 08:20:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:14,002 INFO L225 Difference]: With dead ends: 2338 [2025-01-09 08:20:14,002 INFO L226 Difference]: Without dead ends: 1244 [2025-01-09 08:20:14,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:14,004 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1613 mSDsluCounter, 6737 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 8425 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:14,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1613 Valid, 8425 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2025-01-09 08:20:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1241. [2025-01-09 08:20:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1240 states have (on average 1.485483870967742) internal successors, (1842), 1240 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1842 transitions. [2025-01-09 08:20:14,024 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1842 transitions. Word has length 201 [2025-01-09 08:20:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:14,024 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1842 transitions. [2025-01-09 08:20:14,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.714285714285715) internal successors, (201), 7 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1842 transitions. [2025-01-09 08:20:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 08:20:14,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:14,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:14,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:20:14,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:14,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 857546934, now seen corresponding path program 1 times [2025-01-09 08:20:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786977738] [2025-01-09 08:20:14,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:14,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 08:20:14,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 08:20:14,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:14,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:14,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:14,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786977738] [2025-01-09 08:20:14,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786977738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:14,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:14,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:14,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961435512] [2025-01-09 08:20:14,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:14,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:14,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:14,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:14,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:14,811 INFO L87 Difference]: Start difference. First operand 1241 states and 1842 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:14,865 INFO L93 Difference]: Finished difference Result 2346 states and 3481 transitions. [2025-01-09 08:20:14,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:14,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-01-09 08:20:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:14,869 INFO L225 Difference]: With dead ends: 2346 [2025-01-09 08:20:14,869 INFO L226 Difference]: Without dead ends: 1247 [2025-01-09 08:20:14,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:14,871 INFO L435 NwaCegarLoop]: 1717 mSDtfsCounter, 5 mSDsluCounter, 5142 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6859 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:14,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6859 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2025-01-09 08:20:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1245. [2025-01-09 08:20:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1244 states have (on average 1.484726688102894) internal successors, (1847), 1244 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1847 transitions. [2025-01-09 08:20:14,888 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1847 transitions. Word has length 202 [2025-01-09 08:20:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:14,888 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1847 transitions. [2025-01-09 08:20:14,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1847 transitions. [2025-01-09 08:20:14,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 08:20:14,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:14,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:14,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:20:14,890 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:14,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:14,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1314495715, now seen corresponding path program 1 times [2025-01-09 08:20:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237469672] [2025-01-09 08:20:14,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:14,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:14,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 08:20:15,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 08:20:15,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:15,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:15,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:15,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237469672] [2025-01-09 08:20:15,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237469672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:15,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:15,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:15,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017215754] [2025-01-09 08:20:15,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:15,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:15,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:15,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:15,604 INFO L87 Difference]: Start difference. First operand 1245 states and 1847 transitions. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:15,704 INFO L93 Difference]: Finished difference Result 2390 states and 3542 transitions. [2025-01-09 08:20:15,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:15,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-01-09 08:20:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:15,708 INFO L225 Difference]: With dead ends: 2390 [2025-01-09 08:20:15,709 INFO L226 Difference]: Without dead ends: 1287 [2025-01-09 08:20:15,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:15,711 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 30 mSDsluCounter, 10254 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11966 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:15,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11966 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2025-01-09 08:20:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1283. [2025-01-09 08:20:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1282 states have (on average 1.4828393135725428) internal successors, (1901), 1282 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1901 transitions. [2025-01-09 08:20:15,731 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1901 transitions. Word has length 202 [2025-01-09 08:20:15,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:15,731 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1901 transitions. [2025-01-09 08:20:15,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1901 transitions. [2025-01-09 08:20:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 08:20:15,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:15,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:15,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:20:15,734 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:15,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:15,735 INFO L85 PathProgramCache]: Analyzing trace with hash 836426767, now seen corresponding path program 1 times [2025-01-09 08:20:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:15,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863508671] [2025-01-09 08:20:15,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:15,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 08:20:15,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 08:20:15,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:15,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:16,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:16,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863508671] [2025-01-09 08:20:16,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863508671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:16,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:16,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:16,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709500859] [2025-01-09 08:20:16,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:16,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:16,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:16,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:16,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:16,020 INFO L87 Difference]: Start difference. First operand 1283 states and 1901 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:16,066 INFO L93 Difference]: Finished difference Result 2436 states and 3608 transitions. [2025-01-09 08:20:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-01-09 08:20:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:16,070 INFO L225 Difference]: With dead ends: 2436 [2025-01-09 08:20:16,070 INFO L226 Difference]: Without dead ends: 1295 [2025-01-09 08:20:16,072 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-01-09 08:20:16,073 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 4 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6868 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:16,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6868 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2025-01-09 08:20:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2025-01-09 08:20:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1294 states have (on average 1.48145285935085) internal successors, (1917), 1294 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1917 transitions. [2025-01-09 08:20:16,091 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1917 transitions. Word has length 202 [2025-01-09 08:20:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:16,092 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 1917 transitions. [2025-01-09 08:20:16,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1917 transitions. [2025-01-09 08:20:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 08:20:16,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:16,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:16,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:20:16,094 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:16,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1791274326, now seen corresponding path program 1 times [2025-01-09 08:20:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340479244] [2025-01-09 08:20:16,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:16,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:16,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 08:20:16,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 08:20:16,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:16,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:17,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:17,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340479244] [2025-01-09 08:20:17,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340479244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:17,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:17,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056869152] [2025-01-09 08:20:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:17,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:17,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:17,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:17,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:17,077 INFO L87 Difference]: Start difference. First operand 1295 states and 1917 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:17,195 INFO L93 Difference]: Finished difference Result 2453 states and 3629 transitions. [2025-01-09 08:20:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:17,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-01-09 08:20:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:17,199 INFO L225 Difference]: With dead ends: 2453 [2025-01-09 08:20:17,199 INFO L226 Difference]: Without dead ends: 1300 [2025-01-09 08:20:17,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-01-09 08:20:17,202 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1639 mSDsluCounter, 3368 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 5056 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:17,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 5056 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-01-09 08:20:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2025-01-09 08:20:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1299 states have (on average 1.4803695150115475) internal successors, (1923), 1299 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1923 transitions. [2025-01-09 08:20:17,220 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1923 transitions. Word has length 202 [2025-01-09 08:20:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:17,220 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1923 transitions. [2025-01-09 08:20:17,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1923 transitions. [2025-01-09 08:20:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 08:20:17,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:17,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:17,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:20:17,223 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:17,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash -798849247, now seen corresponding path program 1 times [2025-01-09 08:20:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:17,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944155406] [2025-01-09 08:20:17,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:17,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:17,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 08:20:17,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 08:20:17,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:17,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:17,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:17,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944155406] [2025-01-09 08:20:17,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944155406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:17,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:17,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248773435] [2025-01-09 08:20:17,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:17,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:17,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:17,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:17,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:17,529 INFO L87 Difference]: Start difference. First operand 1300 states and 1923 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:17,561 INFO L93 Difference]: Finished difference Result 2460 states and 3637 transitions. [2025-01-09 08:20:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:17,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-01-09 08:20:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:17,569 INFO L225 Difference]: With dead ends: 2460 [2025-01-09 08:20:17,571 INFO L226 Difference]: Without dead ends: 1302 [2025-01-09 08:20:17,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:17,574 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5153 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:17,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5153 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-01-09 08:20:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2025-01-09 08:20:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1301 states have (on average 1.479631053036126) internal successors, (1925), 1301 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1925 transitions. [2025-01-09 08:20:17,604 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1925 transitions. Word has length 202 [2025-01-09 08:20:17,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:17,604 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1925 transitions. [2025-01-09 08:20:17,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1925 transitions. [2025-01-09 08:20:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 08:20:17,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:17,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:17,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 08:20:17,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:17,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash 288192972, now seen corresponding path program 1 times [2025-01-09 08:20:17,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:17,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951959354] [2025-01-09 08:20:17,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:17,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 08:20:17,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 08:20:17,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:17,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:18,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:18,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951959354] [2025-01-09 08:20:18,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951959354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:18,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:18,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:18,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731197316] [2025-01-09 08:20:18,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:18,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:18,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:18,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:18,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:18,351 INFO L87 Difference]: Start difference. First operand 1302 states and 1925 transitions. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:18,437 INFO L93 Difference]: Finished difference Result 2501 states and 3695 transitions. [2025-01-09 08:20:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:18,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-01-09 08:20:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:18,442 INFO L225 Difference]: With dead ends: 2501 [2025-01-09 08:20:18,442 INFO L226 Difference]: Without dead ends: 1341 [2025-01-09 08:20:18,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:18,444 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 30 mSDsluCounter, 10254 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11966 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:18,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11966 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-01-09 08:20:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1337. [2025-01-09 08:20:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1336 states have (on average 1.4790419161676647) internal successors, (1976), 1336 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1976 transitions. [2025-01-09 08:20:18,461 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1976 transitions. Word has length 203 [2025-01-09 08:20:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:18,461 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1976 transitions. [2025-01-09 08:20:18,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1976 transitions. [2025-01-09 08:20:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 08:20:18,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:18,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:18,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:20:18,463 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:18,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash 901019290, now seen corresponding path program 1 times [2025-01-09 08:20:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263010032] [2025-01-09 08:20:18,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:18,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:18,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 08:20:18,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 08:20:18,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:18,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263010032] [2025-01-09 08:20:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263010032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 08:20:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129682811] [2025-01-09 08:20:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:19,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:20:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:19,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:20:19,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:20:19,331 INFO L87 Difference]: Start difference. First operand 1337 states and 1976 transitions. Second operand has 13 states, 13 states have (on average 15.615384615384615) internal successors, (203), 13 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:19,530 INFO L93 Difference]: Finished difference Result 2546 states and 3759 transitions. [2025-01-09 08:20:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:20:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.615384615384615) internal successors, (203), 13 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-01-09 08:20:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:19,535 INFO L225 Difference]: With dead ends: 2546 [2025-01-09 08:20:19,535 INFO L226 Difference]: Without dead ends: 1351 [2025-01-09 08:20:19,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:20:19,537 INFO L435 NwaCegarLoop]: 1711 mSDtfsCounter, 54 mSDsluCounter, 13758 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 15469 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:19,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 15469 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-01-09 08:20:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1343. [2025-01-09 08:20:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1342 states have (on average 1.4783904619970194) internal successors, (1984), 1342 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1984 transitions. [2025-01-09 08:20:19,554 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1984 transitions. Word has length 203 [2025-01-09 08:20:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:19,555 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 1984 transitions. [2025-01-09 08:20:19,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.615384615384615) internal successors, (203), 13 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1984 transitions. [2025-01-09 08:20:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 08:20:19,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:19,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:19,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 08:20:19,557 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:19,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash 294860339, now seen corresponding path program 1 times [2025-01-09 08:20:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:19,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999182059] [2025-01-09 08:20:19,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:19,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 08:20:19,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 08:20:19,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:19,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:19,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:19,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999182059] [2025-01-09 08:20:19,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999182059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:19,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:19,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:19,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522528241] [2025-01-09 08:20:19,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:19,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:19,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:19,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:19,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:19,859 INFO L87 Difference]: Start difference. First operand 1343 states and 1984 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:19,902 INFO L93 Difference]: Finished difference Result 2548 states and 3762 transitions. [2025-01-09 08:20:19,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:19,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-01-09 08:20:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:19,906 INFO L225 Difference]: With dead ends: 2548 [2025-01-09 08:20:19,906 INFO L226 Difference]: Without dead ends: 1347 [2025-01-09 08:20:19,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:19,907 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5153 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:19,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5153 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:19,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-01-09 08:20:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2025-01-09 08:20:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1346 states have (on average 1.4769687964338782) internal successors, (1988), 1346 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1988 transitions. [2025-01-09 08:20:19,921 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1988 transitions. Word has length 203 [2025-01-09 08:20:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:19,922 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1988 transitions. [2025-01-09 08:20:19,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1988 transitions. [2025-01-09 08:20:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 08:20:19,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:19,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:19,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 08:20:19,924 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:19,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:19,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1626295693, now seen corresponding path program 1 times [2025-01-09 08:20:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:19,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043322073] [2025-01-09 08:20:19,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:19,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 08:20:20,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 08:20:20,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:20,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:20,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-01-09 08:20:20,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043322073] [2025-01-09 08:20:20,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043322073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:20,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336889667] [2025-01-09 08:20:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:20,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:20,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:20,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:20,538 INFO L87 Difference]: Start difference. First operand 1347 states and 1988 transitions. Second operand has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:20,704 INFO L93 Difference]: Finished difference Result 2559 states and 3775 transitions. [2025-01-09 08:20:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-01-09 08:20:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:20,712 INFO L225 Difference]: With dead ends: 2559 [2025-01-09 08:20:20,712 INFO L226 Difference]: Without dead ends: 1354 [2025-01-09 08:20:20,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:20,713 INFO L435 NwaCegarLoop]: 1684 mSDtfsCounter, 1538 mSDsluCounter, 6722 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 8406 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:20,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 8406 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-01-09 08:20:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1353. [2025-01-09 08:20:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1352 states have (on average 1.4755917159763314) internal successors, (1995), 1352 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1995 transitions. [2025-01-09 08:20:20,736 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1995 transitions. Word has length 203 [2025-01-09 08:20:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:20,736 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1995 transitions. [2025-01-09 08:20:20,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1995 transitions. [2025-01-09 08:20:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 08:20:20,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:20,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:20,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 08:20:20,738 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:20,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:20,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1605979891, now seen corresponding path program 1 times [2025-01-09 08:20:20,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:20,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241683579] [2025-01-09 08:20:20,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:20,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 08:20:21,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 08:20:21,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:21,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:21,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241683579] [2025-01-09 08:20:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241683579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:21,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:21,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 08:20:21,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460102039] [2025-01-09 08:20:21,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:21,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 08:20:21,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:21,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 08:20:21,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:20:21,887 INFO L87 Difference]: Start difference. First operand 1353 states and 1995 transitions. Second operand has 12 states, 12 states have (on average 17.0) internal successors, (204), 12 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:22,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:22,011 INFO L93 Difference]: Finished difference Result 2619 states and 3854 transitions. [2025-01-09 08:20:22,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:20:22,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 17.0) internal successors, (204), 12 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-01-09 08:20:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:22,018 INFO L225 Difference]: With dead ends: 2619 [2025-01-09 08:20:22,021 INFO L226 Difference]: Without dead ends: 1408 [2025-01-09 08:20:22,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:20:22,023 INFO L435 NwaCegarLoop]: 1709 mSDtfsCounter, 44 mSDsluCounter, 13727 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 15436 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:22,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 15436 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-01-09 08:20:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1394. [2025-01-09 08:20:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.4723618090452262) internal successors, (2051), 1393 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2051 transitions. [2025-01-09 08:20:22,038 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2051 transitions. Word has length 204 [2025-01-09 08:20:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:22,038 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2051 transitions. [2025-01-09 08:20:22,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.0) internal successors, (204), 12 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2051 transitions. [2025-01-09 08:20:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 08:20:22,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:22,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:22,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 08:20:22,041 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:22,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash -771230074, now seen corresponding path program 1 times [2025-01-09 08:20:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:22,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519922060] [2025-01-09 08:20:22,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:22,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:22,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 08:20:22,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 08:20:22,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:22,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519922060] [2025-01-09 08:20:22,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519922060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:22,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:22,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:22,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290051865] [2025-01-09 08:20:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:22,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:22,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:22,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:22,528 INFO L87 Difference]: Start difference. First operand 1394 states and 2051 transitions. Second operand has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:23,285 INFO L93 Difference]: Finished difference Result 3279 states and 4800 transitions. [2025-01-09 08:20:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:23,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-01-09 08:20:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:23,291 INFO L225 Difference]: With dead ends: 3279 [2025-01-09 08:20:23,291 INFO L226 Difference]: Without dead ends: 2027 [2025-01-09 08:20:23,295 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-01-09 08:20:23,296 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 2696 mSDsluCounter, 4148 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2696 SdHoareTripleChecker+Valid, 5535 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:23,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2696 Valid, 5535 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:20:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2025-01-09 08:20:23,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1661. [2025-01-09 08:20:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1660 states have (on average 1.4686746987951806) internal successors, (2438), 1660 states have internal predecessors, (2438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2438 transitions. [2025-01-09 08:20:23,317 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2438 transitions. Word has length 204 [2025-01-09 08:20:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:23,317 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2438 transitions. [2025-01-09 08:20:23,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2438 transitions. [2025-01-09 08:20:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 08:20:23,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:23,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:23,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 08:20:23,319 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:23,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:23,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1494852981, now seen corresponding path program 1 times [2025-01-09 08:20:23,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:23,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576690515] [2025-01-09 08:20:23,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:23,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:23,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 08:20:23,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 08:20:23,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:23,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:23,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:23,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576690515] [2025-01-09 08:20:23,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576690515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:23,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:23,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:23,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176735523] [2025-01-09 08:20:23,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:23,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:23,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:23,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:23,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:23,581 INFO L87 Difference]: Start difference. First operand 1661 states and 2438 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:23,613 INFO L93 Difference]: Finished difference Result 2998 states and 4399 transitions. [2025-01-09 08:20:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:23,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-01-09 08:20:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:23,617 INFO L225 Difference]: With dead ends: 2998 [2025-01-09 08:20:23,619 INFO L226 Difference]: Without dead ends: 1673 [2025-01-09 08:20:23,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:23,621 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 5147 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6868 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:23,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6868 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-01-09 08:20:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-01-09 08:20:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1672 states have (on average 1.465311004784689) internal successors, (2450), 1672 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2450 transitions. [2025-01-09 08:20:23,640 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2450 transitions. Word has length 204 [2025-01-09 08:20:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:23,641 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2450 transitions. [2025-01-09 08:20:23,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2450 transitions. [2025-01-09 08:20:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 08:20:23,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:23,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:23,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 08:20:23,642 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1670982382, now seen corresponding path program 1 times [2025-01-09 08:20:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793221386] [2025-01-09 08:20:23,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:23,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 08:20:23,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 08:20:23,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:23,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:24,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:24,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793221386] [2025-01-09 08:20:24,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793221386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:24,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:24,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032416680] [2025-01-09 08:20:24,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:24,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:24,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:24,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:24,109 INFO L87 Difference]: Start difference. First operand 1673 states and 2450 transitions. Second operand has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:24,834 INFO L93 Difference]: Finished difference Result 3407 states and 4966 transitions. [2025-01-09 08:20:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:24,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-01-09 08:20:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:24,837 INFO L225 Difference]: With dead ends: 3407 [2025-01-09 08:20:24,837 INFO L226 Difference]: Without dead ends: 2039 [2025-01-09 08:20:24,838 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-01-09 08:20:24,839 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 2724 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 5536 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:24,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 5536 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:20:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2025-01-09 08:20:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1673. [2025-01-09 08:20:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1672 states have (on average 1.4641148325358853) internal successors, (2448), 1672 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2448 transitions. [2025-01-09 08:20:24,854 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2448 transitions. Word has length 204 [2025-01-09 08:20:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:24,855 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2448 transitions. [2025-01-09 08:20:24,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2448 transitions. [2025-01-09 08:20:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 08:20:24,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:24,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:24,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 08:20:24,857 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:24,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1952702495, now seen corresponding path program 1 times [2025-01-09 08:20:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:24,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736317984] [2025-01-09 08:20:24,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:24,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 08:20:24,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 08:20:24,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:24,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:25,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:25,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736317984] [2025-01-09 08:20:25,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736317984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:25,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:25,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307234867] [2025-01-09 08:20:25,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:25,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:25,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:25,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:25,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:25,106 INFO L87 Difference]: Start difference. First operand 1673 states and 2448 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:25,136 INFO L93 Difference]: Finished difference Result 3079 states and 4498 transitions. [2025-01-09 08:20:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:25,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-01-09 08:20:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:25,139 INFO L225 Difference]: With dead ends: 3079 [2025-01-09 08:20:25,139 INFO L226 Difference]: Without dead ends: 1677 [2025-01-09 08:20:25,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:25,140 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5153 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:25,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5153 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2025-01-09 08:20:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1677. [2025-01-09 08:20:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1676 states have (on average 1.4630071599045347) internal successors, (2452), 1676 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2452 transitions. [2025-01-09 08:20:25,155 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2452 transitions. Word has length 204 [2025-01-09 08:20:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:25,155 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2452 transitions. [2025-01-09 08:20:25,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2452 transitions. [2025-01-09 08:20:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 08:20:25,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:25,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:25,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 08:20:25,158 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:25,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash -897038841, now seen corresponding path program 1 times [2025-01-09 08:20:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:25,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930137256] [2025-01-09 08:20:25,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:25,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:25,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 08:20:25,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 08:20:25,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:25,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:25,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:25,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930137256] [2025-01-09 08:20:25,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930137256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:25,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:25,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:25,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713912831] [2025-01-09 08:20:25,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:25,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:25,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:25,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:25,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:25,731 INFO L87 Difference]: Start difference. First operand 1677 states and 2452 transitions. Second operand has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:26,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:26,444 INFO L93 Difference]: Finished difference Result 3303 states and 4817 transitions. [2025-01-09 08:20:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:26,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-01-09 08:20:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:26,448 INFO L225 Difference]: With dead ends: 3303 [2025-01-09 08:20:26,448 INFO L226 Difference]: Without dead ends: 2043 [2025-01-09 08:20:26,449 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-01-09 08:20:26,450 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 2656 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2656 SdHoareTripleChecker+Valid, 5536 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:26,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2656 Valid, 5536 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:20:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-01-09 08:20:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1782. [2025-01-09 08:20:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1781 states have (on average 1.455362156092083) internal successors, (2592), 1781 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2592 transitions. [2025-01-09 08:20:26,474 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2592 transitions. Word has length 205 [2025-01-09 08:20:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:26,474 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2592 transitions. [2025-01-09 08:20:26,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2592 transitions. [2025-01-09 08:20:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 08:20:26,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:26,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:26,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 08:20:26,476 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:26,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1872432032, now seen corresponding path program 1 times [2025-01-09 08:20:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:26,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688963069] [2025-01-09 08:20:26,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:26,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 08:20:26,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 08:20:26,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:26,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:26,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688963069] [2025-01-09 08:20:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688963069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:26,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:26,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:26,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884211854] [2025-01-09 08:20:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:26,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:26,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:26,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:26,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:26,778 INFO L87 Difference]: Start difference. First operand 1782 states and 2592 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:26,808 INFO L93 Difference]: Finished difference Result 3046 states and 4445 transitions. [2025-01-09 08:20:26,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-01-09 08:20:26,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:26,811 INFO L225 Difference]: With dead ends: 3046 [2025-01-09 08:20:26,811 INFO L226 Difference]: Without dead ends: 1786 [2025-01-09 08:20:26,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:26,812 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5153 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:26,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5153 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2025-01-09 08:20:26,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1786. [2025-01-09 08:20:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1785 states have (on average 1.4543417366946778) internal successors, (2596), 1785 states have internal predecessors, (2596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2596 transitions. [2025-01-09 08:20:26,829 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2596 transitions. Word has length 205 [2025-01-09 08:20:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:26,829 INFO L471 AbstractCegarLoop]: Abstraction has 1786 states and 2596 transitions. [2025-01-09 08:20:26,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2596 transitions. [2025-01-09 08:20:26,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 08:20:26,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:26,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:26,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 08:20:26,831 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:26,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:26,831 INFO L85 PathProgramCache]: Analyzing trace with hash -129791495, now seen corresponding path program 1 times [2025-01-09 08:20:26,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:26,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604823633] [2025-01-09 08:20:26,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:26,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:26,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 08:20:27,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 08:20:27,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:27,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604823633] [2025-01-09 08:20:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604823633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:20:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868172016] [2025-01-09 08:20:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:27,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:20:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:27,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:20:27,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:20:27,932 INFO L87 Difference]: Start difference. First operand 1786 states and 2596 transitions. Second operand has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:28,184 INFO L93 Difference]: Finished difference Result 3756 states and 5437 transitions. [2025-01-09 08:20:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:20:28,184 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-01-09 08:20:28,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:28,188 INFO L225 Difference]: With dead ends: 3756 [2025-01-09 08:20:28,188 INFO L226 Difference]: Without dead ends: 2492 [2025-01-09 08:20:28,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:20:28,190 INFO L435 NwaCegarLoop]: 1686 mSDtfsCounter, 2303 mSDsluCounter, 12116 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2303 SdHoareTripleChecker+Valid, 13802 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:28,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2303 Valid, 13802 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-01-09 08:20:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2332. [2025-01-09 08:20:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 2331 states have (on average 1.438009438009438) internal successors, (3352), 2331 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3352 transitions. [2025-01-09 08:20:28,212 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3352 transitions. Word has length 205 [2025-01-09 08:20:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:28,212 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 3352 transitions. [2025-01-09 08:20:28,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3352 transitions. [2025-01-09 08:20:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 08:20:28,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:28,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:28,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 08:20:28,215 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:28,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:28,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2073937771, now seen corresponding path program 1 times [2025-01-09 08:20:28,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:28,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111390057] [2025-01-09 08:20:28,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:28,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:28,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 08:20:28,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 08:20:28,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:28,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:28,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:28,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111390057] [2025-01-09 08:20:28,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111390057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:28,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:28,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:28,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635423922] [2025-01-09 08:20:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:28,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:28,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:28,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:28,883 INFO L87 Difference]: Start difference. First operand 2332 states and 3352 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:28,979 INFO L93 Difference]: Finished difference Result 3954 states and 5704 transitions. [2025-01-09 08:20:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:28,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-01-09 08:20:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:28,983 INFO L225 Difference]: With dead ends: 3954 [2025-01-09 08:20:28,983 INFO L226 Difference]: Without dead ends: 2352 [2025-01-09 08:20:28,985 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-01-09 08:20:28,989 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1588 mSDsluCounter, 3368 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 5056 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:28,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 5056 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2025-01-09 08:20:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2352. [2025-01-09 08:20:29,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2351 states have (on average 1.4359846873670778) internal successors, (3376), 2351 states have internal predecessors, (3376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3376 transitions. [2025-01-09 08:20:29,006 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3376 transitions. Word has length 205 [2025-01-09 08:20:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:29,008 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 3376 transitions. [2025-01-09 08:20:29,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3376 transitions. [2025-01-09 08:20:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 08:20:29,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:29,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:29,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 08:20:29,010 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:29,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1457713312, now seen corresponding path program 1 times [2025-01-09 08:20:29,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:29,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813496006] [2025-01-09 08:20:29,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:29,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:29,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 08:20:29,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 08:20:29,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:29,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:30,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813496006] [2025-01-09 08:20:30,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813496006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:30,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:30,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:30,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051752710] [2025-01-09 08:20:30,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:30,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:30,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:30,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:30,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:30,037 INFO L87 Difference]: Start difference. First operand 2352 states and 3376 transitions. Second operand has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:30,212 INFO L93 Difference]: Finished difference Result 5534 states and 7918 transitions. [2025-01-09 08:20:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:30,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-01-09 08:20:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:30,219 INFO L225 Difference]: With dead ends: 5534 [2025-01-09 08:20:30,219 INFO L226 Difference]: Without dead ends: 3912 [2025-01-09 08:20:30,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:20:30,221 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 2556 mSDsluCounter, 8461 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 10157 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:30,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 10157 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2025-01-09 08:20:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3908. [2025-01-09 08:20:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3907 states have (on average 1.424110570770412) internal successors, (5564), 3907 states have internal predecessors, (5564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5564 transitions. [2025-01-09 08:20:30,263 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5564 transitions. Word has length 205 [2025-01-09 08:20:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:30,264 INFO L471 AbstractCegarLoop]: Abstraction has 3908 states and 5564 transitions. [2025-01-09 08:20:30,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5564 transitions. [2025-01-09 08:20:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 08:20:30,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:30,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:30,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 08:20:30,268 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:30,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash 802055012, now seen corresponding path program 1 times [2025-01-09 08:20:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537058375] [2025-01-09 08:20:30,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:30,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 08:20:30,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 08:20:30,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:30,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537058375] [2025-01-09 08:20:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537058375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105943810] [2025-01-09 08:20:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:30,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:30,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:30,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:30,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:30,999 INFO L87 Difference]: Start difference. First operand 3908 states and 5564 transitions. Second operand has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:31,144 INFO L93 Difference]: Finished difference Result 5534 states and 7918 transitions. [2025-01-09 08:20:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:31,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-01-09 08:20:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:31,150 INFO L225 Difference]: With dead ends: 5534 [2025-01-09 08:20:31,150 INFO L226 Difference]: Without dead ends: 3912 [2025-01-09 08:20:31,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:31,152 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1746 mSDsluCounter, 6403 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 8086 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:31,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 8086 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2025-01-09 08:20:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3908. [2025-01-09 08:20:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3907 states have (on average 1.424110570770412) internal successors, (5564), 3907 states have internal predecessors, (5564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5564 transitions. [2025-01-09 08:20:31,178 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5564 transitions. Word has length 205 [2025-01-09 08:20:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:31,178 INFO L471 AbstractCegarLoop]: Abstraction has 3908 states and 5564 transitions. [2025-01-09 08:20:31,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5564 transitions. [2025-01-09 08:20:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 08:20:31,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:31,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:31,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 08:20:31,182 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:31,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash 947225131, now seen corresponding path program 1 times [2025-01-09 08:20:31,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:31,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870955180] [2025-01-09 08:20:31,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:31,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:31,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 08:20:31,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 08:20:31,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:31,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:31,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:31,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870955180] [2025-01-09 08:20:31,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870955180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:31,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360156080] [2025-01-09 08:20:31,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:31,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:31,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:31,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:31,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:31,419 INFO L87 Difference]: Start difference. First operand 3908 states and 5564 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:31,456 INFO L93 Difference]: Finished difference Result 5574 states and 7978 transitions. [2025-01-09 08:20:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:31,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-01-09 08:20:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:31,462 INFO L225 Difference]: With dead ends: 5574 [2025-01-09 08:20:31,463 INFO L226 Difference]: Without dead ends: 3952 [2025-01-09 08:20:31,466 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-01-09 08:20:31,467 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 20 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6868 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:31,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6868 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-01-09 08:20:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-01-09 08:20:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.4244495064540623) internal successors, (5628), 3951 states have internal predecessors, (5628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5628 transitions. [2025-01-09 08:20:31,502 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5628 transitions. Word has length 205 [2025-01-09 08:20:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:31,502 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 5628 transitions. [2025-01-09 08:20:31,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5628 transitions. [2025-01-09 08:20:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 08:20:31,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:31,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:31,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 08:20:31,507 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:31,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:31,507 INFO L85 PathProgramCache]: Analyzing trace with hash 658447932, now seen corresponding path program 1 times [2025-01-09 08:20:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:31,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364242156] [2025-01-09 08:20:31,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:31,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:20:31,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:20:31,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:31,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364242156] [2025-01-09 08:20:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364242156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 08:20:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991557075] [2025-01-09 08:20:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:32,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 08:20:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:32,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 08:20:32,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:20:32,525 INFO L87 Difference]: Start difference. First operand 3952 states and 5628 transitions. Second operand has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 15 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:32,778 INFO L93 Difference]: Finished difference Result 6302 states and 9006 transitions. [2025-01-09 08:20:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 08:20:32,778 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 15 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-01-09 08:20:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:32,784 INFO L225 Difference]: With dead ends: 6302 [2025-01-09 08:20:32,784 INFO L226 Difference]: Without dead ends: 4428 [2025-01-09 08:20:32,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:20:32,787 INFO L435 NwaCegarLoop]: 1702 mSDtfsCounter, 71 mSDsluCounter, 22100 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 23802 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:32,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 23802 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2025-01-09 08:20:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 4344. [2025-01-09 08:20:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4344 states, 4343 states have (on average 1.4220584849182594) internal successors, (6176), 4343 states have internal predecessors, (6176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 6176 transitions. [2025-01-09 08:20:32,819 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 6176 transitions. Word has length 206 [2025-01-09 08:20:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:32,819 INFO L471 AbstractCegarLoop]: Abstraction has 4344 states and 6176 transitions. [2025-01-09 08:20:32,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.733333333333333) internal successors, (206), 15 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 6176 transitions. [2025-01-09 08:20:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 08:20:32,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:32,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:32,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 08:20:32,823 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:32,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1122508124, now seen corresponding path program 1 times [2025-01-09 08:20:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:32,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226602191] [2025-01-09 08:20:32,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:32,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:20:32,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:20:32,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:32,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:33,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:33,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226602191] [2025-01-09 08:20:33,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226602191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:33,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:33,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:33,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353579328] [2025-01-09 08:20:33,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:33,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:33,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:33,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:33,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:33,080 INFO L87 Difference]: Start difference. First operand 4344 states and 6176 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:33,132 INFO L93 Difference]: Finished difference Result 6980 states and 9966 transitions. [2025-01-09 08:20:33,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:33,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-01-09 08:20:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:33,136 INFO L225 Difference]: With dead ends: 6980 [2025-01-09 08:20:33,136 INFO L226 Difference]: Without dead ends: 4392 [2025-01-09 08:20:33,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:33,138 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5153 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:33,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5153 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2025-01-09 08:20:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 4392. [2025-01-09 08:20:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4392 states, 4391 states have (on average 1.4174447734001367) internal successors, (6224), 4391 states have internal predecessors, (6224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4392 states to 4392 states and 6224 transitions. [2025-01-09 08:20:33,167 INFO L78 Accepts]: Start accepts. Automaton has 4392 states and 6224 transitions. Word has length 206 [2025-01-09 08:20:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:33,168 INFO L471 AbstractCegarLoop]: Abstraction has 4392 states and 6224 transitions. [2025-01-09 08:20:33,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4392 states and 6224 transitions. [2025-01-09 08:20:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 08:20:33,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:33,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:33,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 08:20:33,172 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:33,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash 362604154, now seen corresponding path program 1 times [2025-01-09 08:20:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680387668] [2025-01-09 08:20:33,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:33,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:20:33,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:20:33,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:33,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:33,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680387668] [2025-01-09 08:20:33,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680387668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:33,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:33,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:33,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336288880] [2025-01-09 08:20:33,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:33,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:33,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:33,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:33,634 INFO L87 Difference]: Start difference. First operand 4392 states and 6224 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:33,690 INFO L93 Difference]: Finished difference Result 7921 states and 11223 transitions. [2025-01-09 08:20:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-01-09 08:20:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:33,694 INFO L225 Difference]: With dead ends: 7921 [2025-01-09 08:20:33,694 INFO L226 Difference]: Without dead ends: 5171 [2025-01-09 08:20:33,696 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-01-09 08:20:33,696 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 489 mSDsluCounter, 5138 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 6856 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:33,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 6856 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5171 states. [2025-01-09 08:20:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5171 to 4316. [2025-01-09 08:20:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4316 states, 4315 states have (on average 1.418308227114716) internal successors, (6120), 4315 states have internal predecessors, (6120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4316 states to 4316 states and 6120 transitions. [2025-01-09 08:20:33,724 INFO L78 Accepts]: Start accepts. Automaton has 4316 states and 6120 transitions. Word has length 206 [2025-01-09 08:20:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:33,724 INFO L471 AbstractCegarLoop]: Abstraction has 4316 states and 6120 transitions. [2025-01-09 08:20:33,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4316 states and 6120 transitions. [2025-01-09 08:20:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 08:20:33,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:33,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:33,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 08:20:33,728 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:33,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash -442204661, now seen corresponding path program 1 times [2025-01-09 08:20:33,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:33,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305539386] [2025-01-09 08:20:33,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:33,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:33,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:20:33,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:20:33,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:33,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305539386] [2025-01-09 08:20:34,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305539386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:34,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:34,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:34,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108260440] [2025-01-09 08:20:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:34,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:34,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:34,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:34,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:34,249 INFO L87 Difference]: Start difference. First operand 4316 states and 6120 transitions. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:34,430 INFO L93 Difference]: Finished difference Result 10528 states and 14794 transitions. [2025-01-09 08:20:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:34,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-01-09 08:20:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:34,436 INFO L225 Difference]: With dead ends: 10528 [2025-01-09 08:20:34,436 INFO L226 Difference]: Without dead ends: 6966 [2025-01-09 08:20:34,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:34,440 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 2007 mSDsluCounter, 6772 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 8469 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:34,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 8469 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2025-01-09 08:20:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 5020. [2025-01-09 08:20:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5020 states, 5019 states have (on average 1.4194062562263399) internal successors, (7124), 5019 states have internal predecessors, (7124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 7124 transitions. [2025-01-09 08:20:34,478 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 7124 transitions. Word has length 206 [2025-01-09 08:20:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:34,479 INFO L471 AbstractCegarLoop]: Abstraction has 5020 states and 7124 transitions. [2025-01-09 08:20:34,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 7124 transitions. [2025-01-09 08:20:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 08:20:34,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:34,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:34,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 08:20:34,484 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:34,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1434633835, now seen corresponding path program 1 times [2025-01-09 08:20:34,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:34,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616531038] [2025-01-09 08:20:34,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:34,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:34,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:20:34,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:20:34,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:34,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:35,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616531038] [2025-01-09 08:20:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616531038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:35,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:35,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126890647] [2025-01-09 08:20:35,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:35,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:35,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:35,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:35,077 INFO L87 Difference]: Start difference. First operand 5020 states and 7124 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:35,142 INFO L93 Difference]: Finished difference Result 7629 states and 10859 transitions. [2025-01-09 08:20:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:35,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-01-09 08:20:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:35,153 INFO L225 Difference]: With dead ends: 7629 [2025-01-09 08:20:35,153 INFO L226 Difference]: Without dead ends: 5083 [2025-01-09 08:20:35,156 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-01-09 08:20:35,158 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 499 mSDsluCounter, 5139 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 6857 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:35,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 6857 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2025-01-09 08:20:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 4486. [2025-01-09 08:20:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4486 states, 4485 states have (on average 1.4265328874024525) internal successors, (6398), 4485 states have internal predecessors, (6398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4486 states to 4486 states and 6398 transitions. [2025-01-09 08:20:35,216 INFO L78 Accepts]: Start accepts. Automaton has 4486 states and 6398 transitions. Word has length 206 [2025-01-09 08:20:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:35,220 INFO L471 AbstractCegarLoop]: Abstraction has 4486 states and 6398 transitions. [2025-01-09 08:20:35,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4486 states and 6398 transitions. [2025-01-09 08:20:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 08:20:35,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:35,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:35,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 08:20:35,227 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:35,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1189909020, now seen corresponding path program 1 times [2025-01-09 08:20:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:35,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458816132] [2025-01-09 08:20:35,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:35,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:20:35,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:20:35,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:35,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:35,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458816132] [2025-01-09 08:20:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458816132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:35,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:35,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136707013] [2025-01-09 08:20:35,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:35,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:35,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:35,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:35,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:35,812 INFO L87 Difference]: Start difference. First operand 4486 states and 6398 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:35,947 INFO L93 Difference]: Finished difference Result 10547 states and 14944 transitions. [2025-01-09 08:20:35,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:35,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-01-09 08:20:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:35,954 INFO L225 Difference]: With dead ends: 10547 [2025-01-09 08:20:35,954 INFO L226 Difference]: Without dead ends: 7070 [2025-01-09 08:20:35,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:35,959 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 2337 mSDsluCounter, 5079 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 6776 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:35,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 6776 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7070 states. [2025-01-09 08:20:36,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7070 to 5478. [2025-01-09 08:20:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.4376483476355668) internal successors, (7874), 5477 states have internal predecessors, (7874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 7874 transitions. [2025-01-09 08:20:36,010 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 7874 transitions. Word has length 206 [2025-01-09 08:20:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:36,010 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 7874 transitions. [2025-01-09 08:20:36,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 7874 transitions. [2025-01-09 08:20:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 08:20:36,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:36,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:36,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 08:20:36,019 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:36,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1715323004, now seen corresponding path program 1 times [2025-01-09 08:20:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099303320] [2025-01-09 08:20:36,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:36,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:20:36,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:20:36,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:36,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:36,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:36,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099303320] [2025-01-09 08:20:36,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099303320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:36,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:36,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:36,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083929825] [2025-01-09 08:20:36,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:36,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:36,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:36,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:36,577 INFO L87 Difference]: Start difference. First operand 5478 states and 7874 transitions. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:37,360 INFO L93 Difference]: Finished difference Result 12042 states and 17294 transitions. [2025-01-09 08:20:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:37,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-01-09 08:20:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:37,368 INFO L225 Difference]: With dead ends: 12042 [2025-01-09 08:20:37,368 INFO L226 Difference]: Without dead ends: 7685 [2025-01-09 08:20:37,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:20:37,378 INFO L435 NwaCegarLoop]: 3151 mSDtfsCounter, 2179 mSDsluCounter, 13998 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2179 SdHoareTripleChecker+Valid, 17149 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:37,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2179 Valid, 17149 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:20:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7685 states. [2025-01-09 08:20:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7685 to 6558. [2025-01-09 08:20:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6558 states, 6557 states have (on average 1.4436480097605613) internal successors, (9466), 6557 states have internal predecessors, (9466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 9466 transitions. [2025-01-09 08:20:37,442 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 9466 transitions. Word has length 206 [2025-01-09 08:20:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:37,442 INFO L471 AbstractCegarLoop]: Abstraction has 6558 states and 9466 transitions. [2025-01-09 08:20:37,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 9466 transitions. [2025-01-09 08:20:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 08:20:37,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:37,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:37,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 08:20:37,449 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:37,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash 978819100, now seen corresponding path program 1 times [2025-01-09 08:20:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:37,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368873543] [2025-01-09 08:20:37,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:37,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 08:20:37,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 08:20:37,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:37,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368873543] [2025-01-09 08:20:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368873543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:37,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:37,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751382600] [2025-01-09 08:20:37,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:37,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:37,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:37,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:37,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:37,910 INFO L87 Difference]: Start difference. First operand 6558 states and 9466 transitions. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:38,527 INFO L93 Difference]: Finished difference Result 9707 states and 13954 transitions. [2025-01-09 08:20:38,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:38,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-01-09 08:20:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:38,535 INFO L225 Difference]: With dead ends: 9707 [2025-01-09 08:20:38,535 INFO L226 Difference]: Without dead ends: 7809 [2025-01-09 08:20:38,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:38,538 INFO L435 NwaCegarLoop]: 2229 mSDtfsCounter, 510 mSDsluCounter, 9592 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 11821 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:38,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 11821 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:20:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7809 states. [2025-01-09 08:20:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7809 to 7320. [2025-01-09 08:20:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7320 states, 7319 states have (on average 1.4365350457712802) internal successors, (10514), 7319 states have internal predecessors, (10514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7320 states to 7320 states and 10514 transitions. [2025-01-09 08:20:38,603 INFO L78 Accepts]: Start accepts. Automaton has 7320 states and 10514 transitions. Word has length 206 [2025-01-09 08:20:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:38,603 INFO L471 AbstractCegarLoop]: Abstraction has 7320 states and 10514 transitions. [2025-01-09 08:20:38,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 7320 states and 10514 transitions. [2025-01-09 08:20:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:38,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:38,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:38,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 08:20:38,612 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1405254343, now seen corresponding path program 1 times [2025-01-09 08:20:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:38,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101139353] [2025-01-09 08:20:38,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:38,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:38,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:38,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:38,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:39,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:39,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101139353] [2025-01-09 08:20:39,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101139353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:39,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:39,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:39,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842237917] [2025-01-09 08:20:39,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:39,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:39,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:39,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:39,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:39,096 INFO L87 Difference]: Start difference. First operand 7320 states and 10514 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:39,163 INFO L93 Difference]: Finished difference Result 9917 states and 14244 transitions. [2025-01-09 08:20:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:39,171 INFO L225 Difference]: With dead ends: 9917 [2025-01-09 08:20:39,171 INFO L226 Difference]: Without dead ends: 7883 [2025-01-09 08:20:39,174 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-01-09 08:20:39,175 INFO L435 NwaCegarLoop]: 1730 mSDtfsCounter, 463 mSDsluCounter, 5162 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 6892 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:39,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 6892 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:39,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7883 states. [2025-01-09 08:20:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7883 to 7310. [2025-01-09 08:20:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7310 states, 7309 states have (on average 1.435764126419483) internal successors, (10494), 7309 states have internal predecessors, (10494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 10494 transitions. [2025-01-09 08:20:39,239 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 10494 transitions. Word has length 207 [2025-01-09 08:20:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:39,239 INFO L471 AbstractCegarLoop]: Abstraction has 7310 states and 10494 transitions. [2025-01-09 08:20:39,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 10494 transitions. [2025-01-09 08:20:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:39,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:39,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:39,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 08:20:39,246 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:39,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:39,247 INFO L85 PathProgramCache]: Analyzing trace with hash 842477438, now seen corresponding path program 1 times [2025-01-09 08:20:39,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:39,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519211131] [2025-01-09 08:20:39,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:39,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:39,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:39,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:39,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:40,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-01-09 08:20:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519211131] [2025-01-09 08:20:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519211131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:40,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:40,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-01-09 08:20:40,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297134058] [2025-01-09 08:20:40,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:40,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 08:20:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:40,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 08:20:40,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-01-09 08:20:40,858 INFO L87 Difference]: Start difference. First operand 7310 states and 10494 transitions. Second operand has 25 states, 25 states have (on average 8.28) internal successors, (207), 25 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:41,613 INFO L93 Difference]: Finished difference Result 12737 states and 18069 transitions. [2025-01-09 08:20:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 08:20:41,614 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.28) internal successors, (207), 25 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:41,625 INFO L225 Difference]: With dead ends: 12737 [2025-01-09 08:20:41,625 INFO L226 Difference]: Without dead ends: 10864 [2025-01-09 08:20:41,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2025-01-09 08:20:41,631 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 2014 mSDsluCounter, 24589 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2014 SdHoareTripleChecker+Valid, 26255 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:41,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2014 Valid, 26255 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:20:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10864 states. [2025-01-09 08:20:41,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10864 to 8650. [2025-01-09 08:20:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8650 states, 8649 states have (on average 1.4235171696149844) internal successors, (12312), 8649 states have internal predecessors, (12312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 12312 transitions. [2025-01-09 08:20:41,714 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 12312 transitions. Word has length 207 [2025-01-09 08:20:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:41,715 INFO L471 AbstractCegarLoop]: Abstraction has 8650 states and 12312 transitions. [2025-01-09 08:20:41,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.28) internal successors, (207), 25 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 12312 transitions. [2025-01-09 08:20:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:41,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:41,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:41,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 08:20:41,723 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:41,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1473576645, now seen corresponding path program 1 times [2025-01-09 08:20:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665013641] [2025-01-09 08:20:41,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:41,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:41,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:41,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:41,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:41,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:42,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:42,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665013641] [2025-01-09 08:20:42,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665013641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:42,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:42,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 08:20:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400300916] [2025-01-09 08:20:42,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:42,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 08:20:42,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:42,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 08:20:42,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:20:42,687 INFO L87 Difference]: Start difference. First operand 8650 states and 12312 transitions. Second operand has 18 states, 18 states have (on average 11.5) internal successors, (207), 18 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:42,982 INFO L93 Difference]: Finished difference Result 11342 states and 16144 transitions. [2025-01-09 08:20:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 08:20:42,983 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.5) internal successors, (207), 18 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:42,990 INFO L225 Difference]: With dead ends: 11342 [2025-01-09 08:20:42,991 INFO L226 Difference]: Without dead ends: 9078 [2025-01-09 08:20:42,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:20:42,994 INFO L435 NwaCegarLoop]: 1705 mSDtfsCounter, 100 mSDsluCounter, 25566 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 27271 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:42,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 27271 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9078 states. [2025-01-09 08:20:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9078 to 8980. [2025-01-09 08:20:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8980 states, 8979 states have (on average 1.4219846308052122) internal successors, (12768), 8979 states have internal predecessors, (12768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8980 states to 8980 states and 12768 transitions. [2025-01-09 08:20:43,079 INFO L78 Accepts]: Start accepts. Automaton has 8980 states and 12768 transitions. Word has length 207 [2025-01-09 08:20:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:43,079 INFO L471 AbstractCegarLoop]: Abstraction has 8980 states and 12768 transitions. [2025-01-09 08:20:43,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.5) internal successors, (207), 18 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8980 states and 12768 transitions. [2025-01-09 08:20:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:43,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:43,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:43,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 08:20:43,088 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:43,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash 529007148, now seen corresponding path program 1 times [2025-01-09 08:20:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:43,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944427399] [2025-01-09 08:20:43,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:43,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:43,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:43,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:43,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:43,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944427399] [2025-01-09 08:20:43,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944427399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:43,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:43,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:43,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265505340] [2025-01-09 08:20:43,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:43,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:43,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:43,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:43,499 INFO L87 Difference]: Start difference. First operand 8980 states and 12768 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:44,186 INFO L93 Difference]: Finished difference Result 12237 states and 17400 transitions. [2025-01-09 08:20:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:44,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:44,194 INFO L225 Difference]: With dead ends: 12237 [2025-01-09 08:20:44,194 INFO L226 Difference]: Without dead ends: 9763 [2025-01-09 08:20:44,196 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-01-09 08:20:44,197 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 2572 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 5577 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:44,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2572 Valid, 5577 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:20:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9763 states. [2025-01-09 08:20:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9763 to 9314. [2025-01-09 08:20:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9314 states, 9313 states have (on average 1.4195210995382799) internal successors, (13220), 9313 states have internal predecessors, (13220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9314 states to 9314 states and 13220 transitions. [2025-01-09 08:20:44,268 INFO L78 Accepts]: Start accepts. Automaton has 9314 states and 13220 transitions. Word has length 207 [2025-01-09 08:20:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:44,268 INFO L471 AbstractCegarLoop]: Abstraction has 9314 states and 13220 transitions. [2025-01-09 08:20:44,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9314 states and 13220 transitions. [2025-01-09 08:20:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:44,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:44,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:44,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 08:20:44,277 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:44,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1803666083, now seen corresponding path program 1 times [2025-01-09 08:20:44,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:44,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274836122] [2025-01-09 08:20:44,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:44,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:44,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:44,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:44,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:44,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:44,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274836122] [2025-01-09 08:20:44,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274836122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:44,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:44,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712490622] [2025-01-09 08:20:44,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:44,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:44,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:44,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:44,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:44,519 INFO L87 Difference]: Start difference. First operand 9314 states and 13220 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:44,561 INFO L93 Difference]: Finished difference Result 12476 states and 17718 transitions. [2025-01-09 08:20:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:44,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:44,569 INFO L225 Difference]: With dead ends: 12476 [2025-01-09 08:20:44,569 INFO L226 Difference]: Without dead ends: 9378 [2025-01-09 08:20:44,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:44,574 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 0 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5153 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:44,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5153 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2025-01-09 08:20:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9378. [2025-01-09 08:20:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9378 states, 9377 states have (on average 1.4166577796736697) internal successors, (13284), 9377 states have internal predecessors, (13284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9378 states to 9378 states and 13284 transitions. [2025-01-09 08:20:44,658 INFO L78 Accepts]: Start accepts. Automaton has 9378 states and 13284 transitions. Word has length 207 [2025-01-09 08:20:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:44,658 INFO L471 AbstractCegarLoop]: Abstraction has 9378 states and 13284 transitions. [2025-01-09 08:20:44,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9378 states and 13284 transitions. [2025-01-09 08:20:44,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:44,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:44,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:44,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 08:20:44,678 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:44,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:44,678 INFO L85 PathProgramCache]: Analyzing trace with hash -444224746, now seen corresponding path program 1 times [2025-01-09 08:20:44,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:44,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752689338] [2025-01-09 08:20:44,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:44,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:44,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:44,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:44,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:44,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:45,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:45,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752689338] [2025-01-09 08:20:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752689338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:45,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623733539] [2025-01-09 08:20:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:45,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:45,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:45,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:45,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:45,358 INFO L87 Difference]: Start difference. First operand 9378 states and 13284 transitions. Second operand has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:45,565 INFO L93 Difference]: Finished difference Result 21000 states and 29518 transitions. [2025-01-09 08:20:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:45,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:45,581 INFO L225 Difference]: With dead ends: 21000 [2025-01-09 08:20:45,582 INFO L226 Difference]: Without dead ends: 16528 [2025-01-09 08:20:45,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:45,590 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 2007 mSDsluCounter, 6772 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 8469 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:45,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 8469 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16528 states. [2025-01-09 08:20:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16528 to 14270. [2025-01-09 08:20:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14270 states, 14269 states have (on average 1.4164973018431566) internal successors, (20212), 14269 states have internal predecessors, (20212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14270 states to 14270 states and 20212 transitions. [2025-01-09 08:20:45,815 INFO L78 Accepts]: Start accepts. Automaton has 14270 states and 20212 transitions. Word has length 207 [2025-01-09 08:20:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:45,815 INFO L471 AbstractCegarLoop]: Abstraction has 14270 states and 20212 transitions. [2025-01-09 08:20:45,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 14270 states and 20212 transitions. [2025-01-09 08:20:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:45,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:45,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:45,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 08:20:45,832 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:45,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:45,832 INFO L85 PathProgramCache]: Analyzing trace with hash -222205681, now seen corresponding path program 1 times [2025-01-09 08:20:45,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:45,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627050512] [2025-01-09 08:20:45,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:45,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:45,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:45,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:45,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:45,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627050512] [2025-01-09 08:20:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627050512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:46,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:46,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750028559] [2025-01-09 08:20:46,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:46,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:46,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:46,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:46,477 INFO L87 Difference]: Start difference. First operand 14270 states and 20212 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:46,623 INFO L93 Difference]: Finished difference Result 33036 states and 46390 transitions. [2025-01-09 08:20:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:46,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:46,649 INFO L225 Difference]: With dead ends: 33036 [2025-01-09 08:20:46,650 INFO L226 Difference]: Without dead ends: 25778 [2025-01-09 08:20:46,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:46,662 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 2012 mSDsluCounter, 5080 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 6777 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:46,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 6777 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25778 states. [2025-01-09 08:20:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25778 to 14318. [2025-01-09 08:20:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14318 states, 14317 states have (on average 1.416777257805406) internal successors, (20284), 14317 states have internal predecessors, (20284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14318 states to 14318 states and 20284 transitions. [2025-01-09 08:20:46,815 INFO L78 Accepts]: Start accepts. Automaton has 14318 states and 20284 transitions. Word has length 207 [2025-01-09 08:20:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:46,815 INFO L471 AbstractCegarLoop]: Abstraction has 14318 states and 20284 transitions. [2025-01-09 08:20:46,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 14318 states and 20284 transitions. [2025-01-09 08:20:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:46,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:46,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:46,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 08:20:46,827 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:46,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash -227642993, now seen corresponding path program 1 times [2025-01-09 08:20:46,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:46,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991042803] [2025-01-09 08:20:46,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:46,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:47,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:47,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:47,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:47,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:47,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991042803] [2025-01-09 08:20:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991042803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:47,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:47,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:47,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757557125] [2025-01-09 08:20:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:47,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:47,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:47,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:47,276 INFO L87 Difference]: Start difference. First operand 14318 states and 20284 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:48,093 INFO L93 Difference]: Finished difference Result 17212 states and 24414 transitions. [2025-01-09 08:20:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:48,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:48,106 INFO L225 Difference]: With dead ends: 17212 [2025-01-09 08:20:48,106 INFO L226 Difference]: Without dead ends: 14757 [2025-01-09 08:20:48,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:48,112 INFO L435 NwaCegarLoop]: 2181 mSDtfsCounter, 482 mSDsluCounter, 6951 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 9132 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:48,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 9132 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:20:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14757 states. [2025-01-09 08:20:48,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14757 to 14332. [2025-01-09 08:20:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14332 states, 14331 states have (on average 1.416370106761566) internal successors, (20298), 14331 states have internal predecessors, (20298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 20298 transitions. [2025-01-09 08:20:48,317 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 20298 transitions. Word has length 207 [2025-01-09 08:20:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:48,317 INFO L471 AbstractCegarLoop]: Abstraction has 14332 states and 20298 transitions. [2025-01-09 08:20:48,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 20298 transitions. [2025-01-09 08:20:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:48,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:48,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:48,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 08:20:48,332 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:48,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash 302481305, now seen corresponding path program 1 times [2025-01-09 08:20:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:48,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103563334] [2025-01-09 08:20:48,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:48,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:48,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:48,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:48,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:48,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103563334] [2025-01-09 08:20:48,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103563334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:48,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:48,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:48,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580609883] [2025-01-09 08:20:48,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:48,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:48,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:48,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:48,941 INFO L87 Difference]: Start difference. First operand 14332 states and 20298 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:49,727 INFO L93 Difference]: Finished difference Result 20171 states and 28447 transitions. [2025-01-09 08:20:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:49,745 INFO L225 Difference]: With dead ends: 20171 [2025-01-09 08:20:49,745 INFO L226 Difference]: Without dead ends: 17601 [2025-01-09 08:20:49,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-01-09 08:20:49,752 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1906 mSDsluCounter, 4707 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1906 SdHoareTripleChecker+Valid, 6378 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:49,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1906 Valid, 6378 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:20:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17601 states. [2025-01-09 08:20:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17601 to 15224. [2025-01-09 08:20:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15224 states, 15223 states have (on average 1.4125993562372725) internal successors, (21504), 15223 states have internal predecessors, (21504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15224 states to 15224 states and 21504 transitions. [2025-01-09 08:20:49,893 INFO L78 Accepts]: Start accepts. Automaton has 15224 states and 21504 transitions. Word has length 207 [2025-01-09 08:20:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:49,894 INFO L471 AbstractCegarLoop]: Abstraction has 15224 states and 21504 transitions. [2025-01-09 08:20:49,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 15224 states and 21504 transitions. [2025-01-09 08:20:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:49,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:49,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:49,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 08:20:49,906 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:49,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1298343887, now seen corresponding path program 1 times [2025-01-09 08:20:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:49,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380588042] [2025-01-09 08:20:49,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:49,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:49,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:50,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:50,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:50,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380588042] [2025-01-09 08:20:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380588042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:50,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:50,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224634018] [2025-01-09 08:20:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:50,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:50,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:50,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:50,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:50,507 INFO L87 Difference]: Start difference. First operand 15224 states and 21504 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:51,283 INFO L93 Difference]: Finished difference Result 23230 states and 32609 transitions. [2025-01-09 08:20:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:51,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:51,301 INFO L225 Difference]: With dead ends: 23230 [2025-01-09 08:20:51,301 INFO L226 Difference]: Without dead ends: 18911 [2025-01-09 08:20:51,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:51,308 INFO L435 NwaCegarLoop]: 1702 mSDtfsCounter, 1983 mSDsluCounter, 4768 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 6470 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:51,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 6470 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:20:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18911 states. [2025-01-09 08:20:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18911 to 16600. [2025-01-09 08:20:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16600 states, 16599 states have (on average 1.405385866618471) internal successors, (23328), 16599 states have internal predecessors, (23328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16600 states to 16600 states and 23328 transitions. [2025-01-09 08:20:51,446 INFO L78 Accepts]: Start accepts. Automaton has 16600 states and 23328 transitions. Word has length 207 [2025-01-09 08:20:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:51,446 INFO L471 AbstractCegarLoop]: Abstraction has 16600 states and 23328 transitions. [2025-01-09 08:20:51,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 16600 states and 23328 transitions. [2025-01-09 08:20:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 08:20:51,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:51,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:51,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 08:20:51,459 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:51,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:51,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1499674969, now seen corresponding path program 1 times [2025-01-09 08:20:51,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:51,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529138335] [2025-01-09 08:20:51,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:51,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 08:20:51,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 08:20:51,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:51,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:51,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:51,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529138335] [2025-01-09 08:20:51,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529138335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:51,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:51,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:51,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908942218] [2025-01-09 08:20:51,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:51,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:51,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:51,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:51,910 INFO L87 Difference]: Start difference. First operand 16600 states and 23328 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:52,077 INFO L93 Difference]: Finished difference Result 40573 states and 56540 transitions. [2025-01-09 08:20:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:52,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 08:20:52,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:52,110 INFO L225 Difference]: With dead ends: 40573 [2025-01-09 08:20:52,110 INFO L226 Difference]: Without dead ends: 29616 [2025-01-09 08:20:52,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:52,125 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 2330 mSDsluCounter, 5079 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2330 SdHoareTripleChecker+Valid, 6776 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:52,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2330 Valid, 6776 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29616 states. [2025-01-09 08:20:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29616 to 19360. [2025-01-09 08:20:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19360 states, 19359 states have (on average 1.4182550751588408) internal successors, (27456), 19359 states have internal predecessors, (27456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19360 states to 19360 states and 27456 transitions. [2025-01-09 08:20:52,331 INFO L78 Accepts]: Start accepts. Automaton has 19360 states and 27456 transitions. Word has length 207 [2025-01-09 08:20:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:52,332 INFO L471 AbstractCegarLoop]: Abstraction has 19360 states and 27456 transitions. [2025-01-09 08:20:52,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 19360 states and 27456 transitions. [2025-01-09 08:20:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 08:20:52,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:52,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 08:20:52,347 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:52,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:52,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1885433408, now seen corresponding path program 1 times [2025-01-09 08:20:52,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:52,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892042283] [2025-01-09 08:20:52,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:52,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:52,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 08:20:52,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 08:20:52,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:52,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:20:52,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:20:52,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 08:20:52,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 08:20:52,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:52,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:20:52,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:20:52,957 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:20:52,958 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:20:52,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 08:20:52,961 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] [2025-01-09 08:20:53,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:20:53,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:20:53 BoogieIcfgContainer [2025-01-09 08:20:53,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:20:53,063 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:20:53,063 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:20:53,063 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:20:53,063 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:03" (3/4) ... [2025-01-09 08:20:53,065 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:20:53,065 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:20:53,066 INFO L158 Benchmark]: Toolchain (without parser) took 54216.33ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 106.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 250.3MB. Max. memory is 16.1GB. [2025-01-09 08:20:53,066 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 201.3MB. Free memory was 127.3MB in the beginning and 127.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:20:53,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 661.27ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 77.9MB in the end (delta: 28.6MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2025-01-09 08:20:53,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 433.83ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 77.9MB in the beginning and 218.3MB in the end (delta: -140.4MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2025-01-09 08:20:53,066 INFO L158 Benchmark]: Boogie Preprocessor took 430.65ms. Allocated memory is still 335.5MB. Free memory was 218.3MB in the beginning and 199.7MB in the end (delta: 18.6MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. [2025-01-09 08:20:53,067 INFO L158 Benchmark]: RCFGBuilder took 3335.15ms. Allocated memory was 335.5MB in the beginning and 671.1MB in the end (delta: 335.5MB). Free memory was 199.7MB in the beginning and 428.9MB in the end (delta: -229.2MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB. [2025-01-09 08:20:53,067 INFO L158 Benchmark]: TraceAbstraction took 49340.23ms. Allocated memory was 671.1MB in the beginning and 2.1GB in the end (delta: 1.4GB). Free memory was 426.5MB in the beginning and 1.8GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-01-09 08:20:53,067 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 2.1GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 181.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:20:53,067 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.77ms. Allocated memory is still 201.3MB. Free memory was 127.3MB in the beginning and 127.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 661.27ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 77.9MB in the end (delta: 28.6MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 433.83ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 77.9MB in the beginning and 218.3MB in the end (delta: -140.4MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 430.65ms. Allocated memory is still 335.5MB. Free memory was 218.3MB in the beginning and 199.7MB in the end (delta: 18.6MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. * RCFGBuilder took 3335.15ms. Allocated memory was 335.5MB in the beginning and 671.1MB in the end (delta: 335.5MB). Free memory was 199.7MB in the beginning and 428.9MB in the end (delta: -229.2MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB. * TraceAbstraction took 49340.23ms. Allocated memory was 671.1MB in the beginning and 2.1GB in the end (delta: 1.4GB). Free memory was 426.5MB in the beginning and 1.8GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 2.1GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 181.3kB). 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 bitwiseAnd at line 528, overapproximation of bitwiseAnd at line 412. 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 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_25 mask_SORT_25 = (SORT_25)-1 >> (sizeof(SORT_25) * 8 - 4); [L33] const SORT_25 msb_SORT_25 = (SORT_25)1 << (4 - 1); [L35] const SORT_187 mask_SORT_187 = (SORT_187)-1 >> (sizeof(SORT_187) * 8 - 32); [L36] const SORT_187 msb_SORT_187 = (SORT_187)1 << (32 - 1); [L38] const SORT_195 mask_SORT_195 = (SORT_195)-1 >> (sizeof(SORT_195) * 8 - 3); [L39] const SORT_195 msb_SORT_195 = (SORT_195)1 << (3 - 1); [L41] const SORT_1 var_11 = 0; [L42] const SORT_3 var_14 = 2; [L43] const SORT_1 var_28 = 1; [L44] const SORT_187 var_189 = 1; [L45] const SORT_3 var_274 = 0; [L46] const SORT_3 var_275 = 3; [L47] const SORT_187 var_284 = 0; [L48] const SORT_187 var_495 = 2; [L50] SORT_1 input_2; [L51] SORT_3 input_4; [L52] SORT_3 input_5; [L53] SORT_1 input_6; [L54] SORT_3 input_7; [L55] SORT_1 input_8; [L56] SORT_1 input_9; [L57] SORT_1 input_181; [L58] SORT_3 input_273; [L59] SORT_3 input_289; [L60] SORT_3 input_290; [L61] SORT_3 input_291; [L62] SORT_3 input_292; [L63] SORT_3 input_319; [L64] SORT_3 input_320; [L65] SORT_3 input_321; [L66] SORT_3 input_330; [L67] SORT_3 input_384; [L68] SORT_3 input_396; [L69] SORT_3 input_397; [L70] SORT_3 input_398; [L71] SORT_3 input_399; [L72] SORT_3 input_408; [L73] SORT_3 input_429; [L74] SORT_3 input_430; [L75] SORT_3 input_431; [L76] SORT_3 input_440; [L77] SORT_3 input_442; [L78] SORT_3 input_488; [L79] SORT_3 input_502; [L80] SORT_3 input_503; [L81] SORT_3 input_504; [L82] SORT_3 input_505; [L83] SORT_3 input_514; [L84] SORT_3 input_516; [L85] SORT_3 input_538; [L86] SORT_3 input_539; [L87] SORT_3 input_540; [L88] SORT_3 input_549; [L89] SORT_3 input_551; [L90] SORT_3 input_553; [L91] SORT_3 input_599; [L92] SORT_3 input_610; [L93] SORT_3 input_611; [L94] SORT_3 input_612; [L95] SORT_3 input_620; [L96] SORT_3 input_622; [L97] SORT_3 input_624; [L98] SORT_3 input_644; [L99] SORT_3 input_645; [L100] SORT_3 input_653; [L101] SORT_3 input_655; [L102] SORT_3 input_657; [L103] SORT_3 input_659; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L105] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, state_10=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L106] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, state_10=0, state_13=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L107] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L108] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L109] SORT_3 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_25 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L110] SORT_25 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_25; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_25 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L111] SORT_25 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_25; [L112] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L112] SORT_3 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L113] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L113] SORT_3 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L114] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L115] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L116] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L117] SORT_3 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L118] SORT_3 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L119] SORT_3 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L120] SORT_3 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L121] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L122] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L122] SORT_3 state_79 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L123] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L123] SORT_3 state_82 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L124] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L124] SORT_3 state_148 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L125] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L125] SORT_3 state_149 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L126] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L126] SORT_3 state_150 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L127] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L127] SORT_3 state_151 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L128] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L128] SORT_3 state_152 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L129] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L129] SORT_3 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L130] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L130] SORT_3 state_154 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L131] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L131] SORT_3 state_155 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L132] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L132] SORT_3 state_156 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L133] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L133] SORT_3 state_157 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L134] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L134] SORT_3 state_158 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L135] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L135] SORT_3 state_159 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L136] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L136] SORT_3 state_160 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L137] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L137] SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L138] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L138] SORT_3 state_162 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L139] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L139] SORT_3 state_163 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L143] input_2 = __VERIFIER_nondet_uchar() [L144] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L144] input_2 = input_2 & mask_SORT_1 [L145] input_4 = __VERIFIER_nondet_uchar() [L146] input_5 = __VERIFIER_nondet_uchar() [L147] input_6 = __VERIFIER_nondet_uchar() [L148] input_7 = __VERIFIER_nondet_uchar() [L149] input_8 = __VERIFIER_nondet_uchar() [L150] input_9 = __VERIFIER_nondet_uchar() [L151] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L151] input_9 = input_9 & mask_SORT_1 [L152] input_181 = __VERIFIER_nondet_uchar() [L153] input_273 = __VERIFIER_nondet_uchar() [L154] input_289 = __VERIFIER_nondet_uchar() [L155] input_290 = __VERIFIER_nondet_uchar() [L156] input_291 = __VERIFIER_nondet_uchar() [L157] input_292 = __VERIFIER_nondet_uchar() [L158] input_319 = __VERIFIER_nondet_uchar() [L159] input_320 = __VERIFIER_nondet_uchar() [L160] input_321 = __VERIFIER_nondet_uchar() [L161] input_330 = __VERIFIER_nondet_uchar() [L162] input_384 = __VERIFIER_nondet_uchar() [L163] input_396 = __VERIFIER_nondet_uchar() [L164] input_397 = __VERIFIER_nondet_uchar() [L165] input_398 = __VERIFIER_nondet_uchar() [L166] input_399 = __VERIFIER_nondet_uchar() [L167] input_408 = __VERIFIER_nondet_uchar() [L168] input_429 = __VERIFIER_nondet_uchar() [L169] input_430 = __VERIFIER_nondet_uchar() [L170] input_431 = __VERIFIER_nondet_uchar() [L171] input_440 = __VERIFIER_nondet_uchar() [L172] input_442 = __VERIFIER_nondet_uchar() [L173] input_488 = __VERIFIER_nondet_uchar() [L174] input_502 = __VERIFIER_nondet_uchar() [L175] input_503 = __VERIFIER_nondet_uchar() [L176] input_504 = __VERIFIER_nondet_uchar() [L177] input_505 = __VERIFIER_nondet_uchar() [L178] input_514 = __VERIFIER_nondet_uchar() [L179] input_516 = __VERIFIER_nondet_uchar() [L180] input_538 = __VERIFIER_nondet_uchar() [L181] input_539 = __VERIFIER_nondet_uchar() [L182] input_540 = __VERIFIER_nondet_uchar() [L183] input_549 = __VERIFIER_nondet_uchar() [L184] input_551 = __VERIFIER_nondet_uchar() [L185] input_553 = __VERIFIER_nondet_uchar() [L186] input_599 = __VERIFIER_nondet_uchar() [L187] input_610 = __VERIFIER_nondet_uchar() [L188] input_611 = __VERIFIER_nondet_uchar() [L189] input_612 = __VERIFIER_nondet_uchar() [L190] input_620 = __VERIFIER_nondet_uchar() [L191] input_622 = __VERIFIER_nondet_uchar() [L192] input_624 = __VERIFIER_nondet_uchar() [L193] input_644 = __VERIFIER_nondet_uchar() [L194] input_645 = __VERIFIER_nondet_uchar() [L195] input_653 = __VERIFIER_nondet_uchar() [L196] input_655 = __VERIFIER_nondet_uchar() [L197] input_657 = __VERIFIER_nondet_uchar() [L198] input_659 = __VERIFIER_nondet_uchar() [L201] SORT_1 var_12_arg_0 = state_10; [L202] SORT_1 var_12_arg_1 = var_11; [L203] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L204] SORT_3 var_15_arg_0 = state_13; [L205] SORT_3 var_15_arg_1 = var_14; [L206] SORT_1 var_15 = var_15_arg_0 >= var_15_arg_1; [L207] SORT_3 var_17_arg_0 = state_16; [L208] SORT_3 var_17_arg_1 = var_14; [L209] SORT_1 var_17 = var_17_arg_0 >= var_17_arg_1; [L210] SORT_1 var_18_arg_0 = var_15; [L211] SORT_1 var_18_arg_1 = var_17; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_18_arg_0=0, var_18_arg_1=0, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L212] EXPR var_18_arg_0 & var_18_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L212] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L213] SORT_3 var_20_arg_0 = state_19; [L214] SORT_3 var_20_arg_1 = var_14; [L215] SORT_1 var_20 = var_20_arg_0 >= var_20_arg_1; [L216] SORT_1 var_21_arg_0 = var_18; [L217] SORT_1 var_21_arg_1 = var_20; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_21_arg_0=0, var_21_arg_1=0, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L218] EXPR var_21_arg_0 & var_21_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L218] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L219] SORT_3 var_23_arg_0 = state_22; [L220] SORT_3 var_23_arg_1 = var_14; [L221] SORT_1 var_23 = var_23_arg_0 >= var_23_arg_1; [L222] SORT_1 var_24_arg_0 = var_21; [L223] SORT_1 var_24_arg_1 = var_23; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_24_arg_0=0, var_24_arg_1=0, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L224] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L224] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L225] SORT_25 var_27_arg_0 = state_26; [L226] SORT_1 var_27 = var_27_arg_0 >> 3; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_24=0, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_495=2] [L227] EXPR var_27 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_24=0, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L227] var_27 = var_27 & mask_SORT_1 [L228] SORT_1 var_29_arg_0 = var_27; [L229] SORT_1 var_29_arg_1 = var_28; [L230] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L231] SORT_1 var_30_arg_0 = var_24; [L232] SORT_1 var_30_arg_1 = var_29; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_30_arg_0=0, var_30_arg_1=0, var_495=2] [L233] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_495=2] [L233] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L234] SORT_1 var_31_arg_0 = var_30; [L235] SORT_1 var_31 = ~var_31_arg_0; [L236] SORT_25 var_33_arg_0 = state_32; [L237] SORT_1 var_33 = var_33_arg_0 >> 3; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_31=-1, var_33=0, var_495=2] [L238] EXPR var_33 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_31=-1, var_495=2] [L238] var_33 = var_33 & mask_SORT_1 [L239] SORT_1 var_34_arg_0 = var_33; [L240] SORT_1 var_34_arg_1 = var_28; [L241] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L242] SORT_1 var_35_arg_0 = var_31; [L243] SORT_1 var_35_arg_1 = var_34; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35_arg_0=-1, var_35_arg_1=0, var_495=2] [L244] EXPR var_35_arg_0 | var_35_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_495=2] [L244] SORT_1 var_35 = var_35_arg_0 | var_35_arg_1; [L245] SORT_3 var_37_arg_0 = state_36; [L246] SORT_3 var_37_arg_1 = var_14; [L247] SORT_1 var_37 = var_37_arg_0 >= var_37_arg_1; [L248] SORT_3 var_39_arg_0 = state_38; [L249] SORT_3 var_39_arg_1 = var_14; [L250] SORT_1 var_39 = var_39_arg_0 >= var_39_arg_1; [L251] SORT_1 var_40_arg_0 = var_37; [L252] SORT_1 var_40_arg_1 = var_39; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_40_arg_0=0, var_40_arg_1=0, var_495=2] [L253] EXPR var_40_arg_0 & var_40_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_495=2] [L253] SORT_1 var_40 = var_40_arg_0 & var_40_arg_1; [L254] SORT_3 var_42_arg_0 = state_41; [L255] SORT_3 var_42_arg_1 = var_14; [L256] SORT_1 var_42 = var_42_arg_0 >= var_42_arg_1; [L257] SORT_1 var_43_arg_0 = var_40; [L258] SORT_1 var_43_arg_1 = var_42; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_43_arg_0=0, var_43_arg_1=0, var_495=2] [L259] EXPR var_43_arg_0 & var_43_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_495=2] [L259] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L260] SORT_3 var_45_arg_0 = state_44; [L261] SORT_3 var_45_arg_1 = var_14; [L262] SORT_1 var_45 = var_45_arg_0 >= var_45_arg_1; [L263] SORT_1 var_46_arg_0 = var_43; [L264] SORT_1 var_46_arg_1 = var_45; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_46_arg_0=0, var_46_arg_1=0, var_495=2] [L265] EXPR var_46_arg_0 & var_46_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_495=2] [L265] SORT_1 var_46 = var_46_arg_0 & var_46_arg_1; [L266] SORT_25 var_47_arg_0 = state_26; [L267] SORT_1 var_47 = var_47_arg_0 >> 2; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_46=0, var_47=0, var_495=2] [L268] EXPR var_47 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_46=0, var_495=2] [L268] var_47 = var_47 & mask_SORT_1 [L269] SORT_1 var_48_arg_0 = var_47; [L270] SORT_1 var_48_arg_1 = var_28; [L271] SORT_1 var_48 = var_48_arg_0 == var_48_arg_1; [L272] SORT_1 var_49_arg_0 = var_46; [L273] SORT_1 var_49_arg_1 = var_48; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2, var_49_arg_0=0, var_49_arg_1=0] [L274] EXPR var_49_arg_0 & var_49_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2] [L274] SORT_1 var_49 = var_49_arg_0 & var_49_arg_1; [L275] SORT_1 var_50_arg_0 = var_49; [L276] SORT_1 var_50 = ~var_50_arg_0; [L277] SORT_25 var_51_arg_0 = state_32; [L278] SORT_1 var_51 = var_51_arg_0 >> 2; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2, var_50=-1, var_51=0] [L279] EXPR var_51 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2, var_50=-1] [L279] var_51 = var_51 & mask_SORT_1 [L280] SORT_1 var_52_arg_0 = var_51; [L281] SORT_1 var_52_arg_1 = var_28; [L282] SORT_1 var_52 = var_52_arg_0 == var_52_arg_1; [L283] SORT_1 var_53_arg_0 = var_50; [L284] SORT_1 var_53_arg_1 = var_52; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2, var_51=0, var_53_arg_0=-1, var_53_arg_1=0] [L285] EXPR var_53_arg_0 | var_53_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2, var_51=0] [L285] SORT_1 var_53 = var_53_arg_0 | var_53_arg_1; [L286] SORT_1 var_54_arg_0 = var_35; [L287] SORT_1 var_54_arg_1 = var_53; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54_arg_0=255, var_54_arg_1=255] [L288] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0] [L288] SORT_1 var_54 = var_54_arg_0 & var_54_arg_1; [L289] SORT_3 var_56_arg_0 = state_55; [L290] SORT_3 var_56_arg_1 = var_14; [L291] SORT_1 var_56 = var_56_arg_0 >= var_56_arg_1; [L292] SORT_3 var_58_arg_0 = state_57; [L293] SORT_3 var_58_arg_1 = var_14; [L294] SORT_1 var_58 = var_58_arg_0 >= var_58_arg_1; [L295] SORT_1 var_59_arg_0 = var_56; [L296] SORT_1 var_59_arg_1 = var_58; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_59_arg_0=0, var_59_arg_1=0] [L297] EXPR var_59_arg_0 & var_59_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255] [L297] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L298] SORT_3 var_61_arg_0 = state_60; [L299] SORT_3 var_61_arg_1 = var_14; [L300] SORT_1 var_61 = var_61_arg_0 >= var_61_arg_1; [L301] SORT_1 var_62_arg_0 = var_59; [L302] SORT_1 var_62_arg_1 = var_61; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_62_arg_0=0, var_62_arg_1=0] [L303] EXPR var_62_arg_0 & var_62_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255] [L303] SORT_1 var_62 = var_62_arg_0 & var_62_arg_1; [L304] SORT_3 var_64_arg_0 = state_63; [L305] SORT_3 var_64_arg_1 = var_14; [L306] SORT_1 var_64 = var_64_arg_0 >= var_64_arg_1; [L307] SORT_1 var_65_arg_0 = var_62; [L308] SORT_1 var_65_arg_1 = var_64; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_65_arg_0=0, var_65_arg_1=0] [L309] EXPR var_65_arg_0 & var_65_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255] [L309] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L310] SORT_25 var_66_arg_0 = state_26; [L311] SORT_1 var_66 = var_66_arg_0 >> 1; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_65=0, var_66=0] [L312] EXPR var_66 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_65=0] [L312] var_66 = var_66 & mask_SORT_1 [L313] SORT_1 var_67_arg_0 = var_66; [L314] SORT_1 var_67_arg_1 = var_28; [L315] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L316] SORT_1 var_68_arg_0 = var_65; [L317] SORT_1 var_68_arg_1 = var_67; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0, var_68_arg_0=0, var_68_arg_1=0] [L318] EXPR var_68_arg_0 & var_68_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0] [L318] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L319] SORT_1 var_69_arg_0 = var_68; [L320] SORT_1 var_69 = ~var_69_arg_0; [L321] SORT_25 var_70_arg_0 = state_32; [L322] SORT_1 var_70 = var_70_arg_0 >> 1; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0, var_69=-1, var_70=0] [L323] EXPR var_70 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0, var_69=-1] [L323] var_70 = var_70 & mask_SORT_1 [L324] SORT_1 var_71_arg_0 = var_70; [L325] SORT_1 var_71_arg_1 = var_28; [L326] SORT_1 var_71 = var_71_arg_0 == var_71_arg_1; [L327] SORT_1 var_72_arg_0 = var_69; [L328] SORT_1 var_72_arg_1 = var_71; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0, var_70=0, var_72_arg_0=-1, var_72_arg_1=0] [L329] EXPR var_72_arg_0 | var_72_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0, var_70=0] [L329] SORT_1 var_72 = var_72_arg_0 | var_72_arg_1; [L330] SORT_1 var_73_arg_0 = var_54; [L331] SORT_1 var_73_arg_1 = var_72; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73_arg_0=255, var_73_arg_1=255] [L332] EXPR var_73_arg_0 & var_73_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0] [L332] SORT_1 var_73 = var_73_arg_0 & var_73_arg_1; [L333] SORT_3 var_75_arg_0 = state_74; [L334] SORT_3 var_75_arg_1 = var_14; [L335] SORT_1 var_75 = var_75_arg_0 >= var_75_arg_1; [L336] SORT_3 var_77_arg_0 = state_76; [L337] SORT_3 var_77_arg_1 = var_14; [L338] SORT_1 var_77 = var_77_arg_0 >= var_77_arg_1; [L339] SORT_1 var_78_arg_0 = var_75; [L340] SORT_1 var_78_arg_1 = var_77; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_78_arg_0=0, var_78_arg_1=0] [L341] EXPR var_78_arg_0 & var_78_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255] [L341] SORT_1 var_78 = var_78_arg_0 & var_78_arg_1; [L342] SORT_3 var_80_arg_0 = state_79; [L343] SORT_3 var_80_arg_1 = var_14; [L344] SORT_1 var_80 = var_80_arg_0 >= var_80_arg_1; [L345] SORT_1 var_81_arg_0 = var_78; [L346] SORT_1 var_81_arg_1 = var_80; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_81_arg_0=0, var_81_arg_1=0] [L347] EXPR var_81_arg_0 & var_81_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255] [L347] SORT_1 var_81 = var_81_arg_0 & var_81_arg_1; [L348] SORT_3 var_83_arg_0 = state_82; [L349] SORT_3 var_83_arg_1 = var_14; [L350] SORT_1 var_83 = var_83_arg_0 >= var_83_arg_1; [L351] SORT_1 var_84_arg_0 = var_81; [L352] SORT_1 var_84_arg_1 = var_83; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_84_arg_0=0, var_84_arg_1=0] [L353] EXPR var_84_arg_0 & var_84_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255] [L353] SORT_1 var_84 = var_84_arg_0 & var_84_arg_1; [L354] SORT_25 var_85_arg_0 = state_26; [L355] SORT_1 var_85 = var_85_arg_0 >> 0; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_84=0, var_85=0] [L356] EXPR var_85 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_84=0] [L356] var_85 = var_85 & mask_SORT_1 [L357] SORT_1 var_86_arg_0 = var_85; [L358] SORT_1 var_86_arg_1 = var_28; [L359] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L360] SORT_1 var_87_arg_0 = var_84; [L361] SORT_1 var_87_arg_1 = var_86; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0, var_87_arg_0=0, var_87_arg_1=0] [L362] EXPR var_87_arg_0 & var_87_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0] [L362] SORT_1 var_87 = var_87_arg_0 & var_87_arg_1; [L363] SORT_1 var_88_arg_0 = var_87; [L364] SORT_1 var_88 = ~var_88_arg_0; [L365] SORT_25 var_89_arg_0 = state_32; [L366] SORT_1 var_89 = var_89_arg_0 >> 0; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0, var_88=-1, var_89=0] [L367] EXPR var_89 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0, var_88=-1] [L367] var_89 = var_89 & mask_SORT_1 [L368] SORT_1 var_90_arg_0 = var_89; [L369] SORT_1 var_90_arg_1 = var_28; [L370] SORT_1 var_90 = var_90_arg_0 == var_90_arg_1; [L371] SORT_1 var_91_arg_0 = var_88; [L372] SORT_1 var_91_arg_1 = var_90; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0, var_89=0, var_91_arg_0=-1, var_91_arg_1=0] [L373] EXPR var_91_arg_0 | var_91_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0, var_89=0] [L373] SORT_1 var_91 = var_91_arg_0 | var_91_arg_1; [L374] SORT_1 var_92_arg_0 = var_73; [L375] SORT_1 var_92_arg_1 = var_91; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92_arg_0=255, var_92_arg_1=255] [L376] EXPR var_92_arg_0 & var_92_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L376] SORT_1 var_92 = var_92_arg_0 & var_92_arg_1; [L377] SORT_3 var_93_arg_0 = state_13; [L378] SORT_3 var_93_arg_1 = var_14; [L379] SORT_1 var_93 = var_93_arg_0 >= var_93_arg_1; [L380] SORT_3 var_94_arg_0 = state_16; [L381] SORT_3 var_94_arg_1 = var_14; [L382] SORT_1 var_94 = var_94_arg_0 >= var_94_arg_1; [L383] SORT_1 var_95_arg_0 = var_93; [L384] SORT_1 var_95_arg_1 = var_94; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255, var_95_arg_0=0, var_95_arg_1=0] [L385] EXPR var_95_arg_0 | var_95_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L385] SORT_1 var_95 = var_95_arg_0 | var_95_arg_1; [L386] SORT_3 var_96_arg_0 = state_19; [L387] SORT_3 var_96_arg_1 = var_14; [L388] SORT_1 var_96 = var_96_arg_0 >= var_96_arg_1; [L389] SORT_1 var_97_arg_0 = var_95; [L390] SORT_1 var_97_arg_1 = var_96; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255, var_97_arg_0=0, var_97_arg_1=0] [L391] EXPR var_97_arg_0 | var_97_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L391] SORT_1 var_97 = var_97_arg_0 | var_97_arg_1; [L392] SORT_3 var_98_arg_0 = state_22; [L393] SORT_3 var_98_arg_1 = var_14; [L394] SORT_1 var_98 = var_98_arg_0 >= var_98_arg_1; [L395] SORT_1 var_99_arg_0 = var_97; [L396] SORT_1 var_99_arg_1 = var_98; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255, var_99_arg_0=0, var_99_arg_1=0] [L397] EXPR var_99_arg_0 | var_99_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L397] SORT_1 var_99 = var_99_arg_0 | var_99_arg_1; [L398] SORT_1 var_100_arg_0 = var_27; [L399] SORT_1 var_100_arg_1 = var_28; [L400] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L401] SORT_1 var_101_arg_0 = var_99; [L402] SORT_1 var_101_arg_1 = var_100; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_101_arg_0=0, var_101_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L403] EXPR var_101_arg_0 | var_101_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L403] SORT_1 var_101 = var_101_arg_0 | var_101_arg_1; [L404] SORT_1 var_102_arg_0 = var_33; [L405] SORT_1 var_102_arg_1 = var_11; [L406] SORT_1 var_102 = var_102_arg_0 == var_102_arg_1; [L407] SORT_1 var_103_arg_0 = var_101; [L408] SORT_1 var_103_arg_1 = var_102; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_103_arg_0=0, var_103_arg_1=1, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L409] EXPR var_103_arg_0 | var_103_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L409] SORT_1 var_103 = var_103_arg_0 | var_103_arg_1; [L410] SORT_1 var_104_arg_0 = var_92; [L411] SORT_1 var_104_arg_1 = var_103; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104_arg_0=255, var_104_arg_1=1, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L412] EXPR var_104_arg_0 & var_104_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L412] SORT_1 var_104 = var_104_arg_0 & var_104_arg_1; [L413] SORT_3 var_105_arg_0 = state_36; [L414] SORT_3 var_105_arg_1 = var_14; [L415] SORT_1 var_105 = var_105_arg_0 >= var_105_arg_1; [L416] SORT_3 var_106_arg_0 = state_38; [L417] SORT_3 var_106_arg_1 = var_14; [L418] SORT_1 var_106 = var_106_arg_0 >= var_106_arg_1; [L419] SORT_1 var_107_arg_0 = var_105; [L420] SORT_1 var_107_arg_1 = var_106; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_107_arg_0=0, var_107_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L421] EXPR var_107_arg_0 | var_107_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L421] SORT_1 var_107 = var_107_arg_0 | var_107_arg_1; [L422] SORT_3 var_108_arg_0 = state_41; [L423] SORT_3 var_108_arg_1 = var_14; [L424] SORT_1 var_108 = var_108_arg_0 >= var_108_arg_1; [L425] SORT_1 var_109_arg_0 = var_107; [L426] SORT_1 var_109_arg_1 = var_108; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_109_arg_0=0, var_109_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L427] EXPR var_109_arg_0 | var_109_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L427] SORT_1 var_109 = var_109_arg_0 | var_109_arg_1; [L428] SORT_3 var_110_arg_0 = state_44; [L429] SORT_3 var_110_arg_1 = var_14; [L430] SORT_1 var_110 = var_110_arg_0 >= var_110_arg_1; [L431] SORT_1 var_111_arg_0 = var_109; [L432] SORT_1 var_111_arg_1 = var_110; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_111_arg_0=0, var_111_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L433] EXPR var_111_arg_0 | var_111_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L433] SORT_1 var_111 = var_111_arg_0 | var_111_arg_1; [L434] SORT_1 var_112_arg_0 = var_47; [L435] SORT_1 var_112_arg_1 = var_28; [L436] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L437] SORT_1 var_113_arg_0 = var_111; [L438] SORT_1 var_113_arg_1 = var_112; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_113_arg_0=0, var_113_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L439] EXPR var_113_arg_0 | var_113_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L439] SORT_1 var_113 = var_113_arg_0 | var_113_arg_1; [L440] SORT_1 var_114_arg_0 = var_51; [L441] SORT_1 var_114_arg_1 = var_11; [L442] SORT_1 var_114 = var_114_arg_0 == var_114_arg_1; [L443] SORT_1 var_115_arg_0 = var_113; [L444] SORT_1 var_115_arg_1 = var_114; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_115_arg_0=0, var_115_arg_1=1, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L445] EXPR var_115_arg_0 | var_115_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L445] SORT_1 var_115 = var_115_arg_0 | var_115_arg_1; [L446] SORT_1 var_116_arg_0 = var_104; [L447] SORT_1 var_116_arg_1 = var_115; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116_arg_0=0, var_116_arg_1=1, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L448] EXPR var_116_arg_0 & var_116_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L448] SORT_1 var_116 = var_116_arg_0 & var_116_arg_1; [L449] SORT_3 var_117_arg_0 = state_55; [L450] SORT_3 var_117_arg_1 = var_14; [L451] SORT_1 var_117 = var_117_arg_0 >= var_117_arg_1; [L452] SORT_3 var_118_arg_0 = state_57; [L453] SORT_3 var_118_arg_1 = var_14; [L454] SORT_1 var_118 = var_118_arg_0 >= var_118_arg_1; [L455] SORT_1 var_119_arg_0 = var_117; [L456] SORT_1 var_119_arg_1 = var_118; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_119_arg_0=0, var_119_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L457] EXPR var_119_arg_0 | var_119_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L457] SORT_1 var_119 = var_119_arg_0 | var_119_arg_1; [L458] SORT_3 var_120_arg_0 = state_60; [L459] SORT_3 var_120_arg_1 = var_14; [L460] SORT_1 var_120 = var_120_arg_0 >= var_120_arg_1; [L461] SORT_1 var_121_arg_0 = var_119; [L462] SORT_1 var_121_arg_1 = var_120; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_121_arg_0=0, var_121_arg_1=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L463] EXPR var_121_arg_0 | var_121_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L463] SORT_1 var_121 = var_121_arg_0 | var_121_arg_1; [L464] SORT_3 var_122_arg_0 = state_63; [L465] SORT_3 var_122_arg_1 = var_14; [L466] SORT_1 var_122 = var_122_arg_0 >= var_122_arg_1; [L467] SORT_1 var_123_arg_0 = var_121; [L468] SORT_1 var_123_arg_1 = var_122; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_123_arg_0=0, var_123_arg_1=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L469] EXPR var_123_arg_0 | var_123_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L469] SORT_1 var_123 = var_123_arg_0 | var_123_arg_1; [L470] SORT_1 var_124_arg_0 = var_66; [L471] SORT_1 var_124_arg_1 = var_28; [L472] SORT_1 var_124 = var_124_arg_0 == var_124_arg_1; [L473] SORT_1 var_125_arg_0 = var_123; [L474] SORT_1 var_125_arg_1 = var_124; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_125_arg_0=0, var_125_arg_1=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L475] EXPR var_125_arg_0 | var_125_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L475] SORT_1 var_125 = var_125_arg_0 | var_125_arg_1; [L476] SORT_1 var_126_arg_0 = var_70; [L477] SORT_1 var_126_arg_1 = var_11; [L478] SORT_1 var_126 = var_126_arg_0 == var_126_arg_1; [L479] SORT_1 var_127_arg_0 = var_125; [L480] SORT_1 var_127_arg_1 = var_126; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_127_arg_0=0, var_127_arg_1=1, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L481] EXPR var_127_arg_0 | var_127_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L481] SORT_1 var_127 = var_127_arg_0 | var_127_arg_1; [L482] SORT_1 var_128_arg_0 = var_116; [L483] SORT_1 var_128_arg_1 = var_127; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_128_arg_0=0, var_128_arg_1=1, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L484] EXPR var_128_arg_0 & var_128_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L484] SORT_1 var_128 = var_128_arg_0 & var_128_arg_1; [L485] SORT_3 var_129_arg_0 = state_74; [L486] SORT_3 var_129_arg_1 = var_14; [L487] SORT_1 var_129 = var_129_arg_0 >= var_129_arg_1; [L488] SORT_3 var_130_arg_0 = state_76; [L489] SORT_3 var_130_arg_1 = var_14; [L490] SORT_1 var_130 = var_130_arg_0 >= var_130_arg_1; [L491] SORT_1 var_131_arg_0 = var_129; [L492] SORT_1 var_131_arg_1 = var_130; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_79=0, state_82=0, var_11=0, var_128=0, var_12=1, var_131_arg_0=0, var_131_arg_1=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L493] EXPR var_131_arg_0 | var_131_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_79=0, state_82=0, var_11=0, var_128=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L493] SORT_1 var_131 = var_131_arg_0 | var_131_arg_1; [L494] SORT_3 var_132_arg_0 = state_79; [L495] SORT_3 var_132_arg_1 = var_14; [L496] SORT_1 var_132 = var_132_arg_0 >= var_132_arg_1; [L497] SORT_1 var_133_arg_0 = var_131; [L498] SORT_1 var_133_arg_1 = var_132; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_82=0, var_11=0, var_128=0, var_12=1, var_133_arg_0=0, var_133_arg_1=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L499] EXPR var_133_arg_0 | var_133_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_82=0, var_11=0, var_128=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L499] SORT_1 var_133 = var_133_arg_0 | var_133_arg_1; [L500] SORT_3 var_134_arg_0 = state_82; [L501] SORT_3 var_134_arg_1 = var_14; [L502] SORT_1 var_134 = var_134_arg_0 >= var_134_arg_1; [L503] SORT_1 var_135_arg_0 = var_133; [L504] SORT_1 var_135_arg_1 = var_134; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_135_arg_0=0, var_135_arg_1=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L505] EXPR var_135_arg_0 | var_135_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L505] SORT_1 var_135 = var_135_arg_0 | var_135_arg_1; [L506] SORT_1 var_136_arg_0 = var_85; [L507] SORT_1 var_136_arg_1 = var_28; [L508] SORT_1 var_136 = var_136_arg_0 == var_136_arg_1; [L509] SORT_1 var_137_arg_0 = var_135; [L510] SORT_1 var_137_arg_1 = var_136; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_137_arg_0=0, var_137_arg_1=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L511] EXPR var_137_arg_0 | var_137_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L511] SORT_1 var_137 = var_137_arg_0 | var_137_arg_1; [L512] SORT_1 var_138_arg_0 = var_89; [L513] SORT_1 var_138_arg_1 = var_11; [L514] SORT_1 var_138 = var_138_arg_0 == var_138_arg_1; [L515] SORT_1 var_139_arg_0 = var_137; [L516] SORT_1 var_139_arg_1 = var_138; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_139_arg_0=0, var_139_arg_1=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L517] EXPR var_139_arg_0 | var_139_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L517] SORT_1 var_139 = var_139_arg_0 | var_139_arg_1; [L518] SORT_1 var_140_arg_0 = var_128; [L519] SORT_1 var_140_arg_1 = var_139; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_12=1, var_140_arg_0=0, var_140_arg_1=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L520] EXPR var_140_arg_0 & var_140_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L520] SORT_1 var_140 = var_140_arg_0 & var_140_arg_1; [L521] SORT_1 var_141_arg_0 = var_12; [L522] SORT_1 var_141_arg_1 = var_140; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_141_arg_0=1, var_141_arg_1=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L523] EXPR var_141_arg_0 | var_141_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L523] SORT_1 var_141 = var_141_arg_0 | var_141_arg_1; [L524] SORT_1 var_144_arg_0 = var_141; [L525] SORT_1 var_144 = ~var_144_arg_0; [L526] SORT_1 var_145_arg_0 = var_28; [L527] SORT_1 var_145_arg_1 = var_144; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_145_arg_0=1, var_145_arg_1=-2, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L528] EXPR var_145_arg_0 & var_145_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L528] SORT_1 var_145 = var_145_arg_0 & var_145_arg_1; [L529] EXPR var_145 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L529] var_145 = var_145 & mask_SORT_1 [L530] SORT_1 bad_146_arg_0 = var_145; [L531] CALL __VERIFIER_assert(!(bad_146_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1154 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.2s, OverallIterations: 52, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46893 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46893 mSDsluCounter, 450789 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362553 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17328 IncrementalHoareTripleChecker+Invalid, 17427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 88236 mSDtfsCounter, 17328 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19360occurred in iteration=51, InterpolantAutomatonStates: 346, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 51 MinimizatonAttempts, 40322 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 10596 NumberOfCodeBlocks, 10596 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 10337 ConstructedInterpolants, 0 QuantifiedInterpolants, 27142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 51 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-01-09 08:20:53,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4fbb35f76027517819b7c383b61e34fa76a9ce203f76a516ef6e2a6ae9cf5da8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:20:55,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:20:55,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 08:20:55,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:20:55,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:20:55,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:20:55,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:20:55,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:20:55,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:20:55,590 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:20:55,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:20:55,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:20:55,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:20:55,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:20:55,591 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:20:55,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:20:55,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:20:55,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:20:55,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:20:55,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:20:55,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:20:55,592 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:20:55,592 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:20:55,592 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:20:55,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:20:55,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:20:55,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:20:55,593 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:20:55,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:20:55,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:20:55,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:20:55,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:55,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:20:55,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:20:55,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:20:55,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:20:55,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:55,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:20:55,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:20:55,594 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:20:55,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:20:55,594 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:20:55,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:20:55,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:20:55,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:20:55,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:20:55,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:20:55,595 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fbb35f76027517819b7c383b61e34fa76a9ce203f76a516ef6e2a6ae9cf5da8 [2025-01-09 08:20:55,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:20:55,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:20:55,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:20:55,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:20:55,854 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:20:55,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-01-09 08:20:57,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6394fc810/63f3ec213451446ba46c47abf16171e0/FLAGade7bfa59 [2025-01-09 08:20:57,492 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:20:57,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-01-09 08:20:57,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6394fc810/63f3ec213451446ba46c47abf16171e0/FLAGade7bfa59 [2025-01-09 08:20:57,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6394fc810/63f3ec213451446ba46c47abf16171e0 [2025-01-09 08:20:57,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:20:57,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:20:57,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:20:57,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:20:57,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:20:57,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:20:57" (1/1) ... [2025-01-09 08:20:57,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bee3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:57, skipping insertion in model container [2025-01-09 08:20:57,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:20:57" (1/1) ... [2025-01-09 08:20:57,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:20:57,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c[1258,1271] [2025-01-09 08:20:58,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:20:58,028 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:20:58,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c[1258,1271] [2025-01-09 08:20:58,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:20:58,170 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:20:58,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58 WrapperNode [2025-01-09 08:20:58,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:20:58,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:20:58,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:20:58,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:20:58,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,346 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2349 [2025-01-09 08:20:58,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:20:58,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:20:58,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:20:58,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:20:58,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,397 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:20:58,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:20:58,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:20:58,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:20:58,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:20:58,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (1/1) ... [2025-01-09 08:20:58,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:58,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:58,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:20:58,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:20:58,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:20:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:20:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:20:58,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:20:58,927 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:20:58,928 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:21:00,742 INFO L? ?]: Removed 400 outVars from TransFormulas that were not future-live. [2025-01-09 08:21:00,742 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:21:00,749 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:21:00,749 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:21:00,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:00 BoogieIcfgContainer [2025-01-09 08:21:00,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:21:00,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:21:00,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:21:00,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:21:00,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:20:57" (1/3) ... [2025-01-09 08:21:00,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1b8796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:21:00, skipping insertion in model container [2025-01-09 08:21:00,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:58" (2/3) ... [2025-01-09 08:21:00,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1b8796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:21:00, skipping insertion in model container [2025-01-09 08:21:00,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:00" (3/3) ... [2025-01-09 08:21:00,760 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-01-09 08:21:00,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:21:00,773 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_bpbs_p2.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:21:00,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:21:00,819 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;@25e0d6f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:21:00,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:21:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:21:00,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:00,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:21:00,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:00,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:21:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:21:00,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330312235] [2025-01-09 08:21:00,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:00,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:00,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:00,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:21:00,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:21:01,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:21:01,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:21:01,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:01,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:21:01,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:21:01,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:21:01,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:21:01,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:01,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:21:01,804 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-09 08:21:01,805 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:21:01,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:21:01,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 08:21:02,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:02,018 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 08:21:02,054 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:21:02,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:21:02 BoogieIcfgContainer [2025-01-09 08:21:02,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:21:02,059 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:21:02,059 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:21:02,059 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:21:02,060 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:00" (3/4) ... [2025-01-09 08:21:02,061 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 08:21:02,122 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 3. [2025-01-09 08:21:02,162 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 08:21:02,162 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 08:21:02,162 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:21:02,163 INFO L158 Benchmark]: Toolchain (without parser) took 4635.02ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 87.1MB in the beginning and 138.7MB in the end (delta: -51.6MB). Peak memory consumption was 252.2MB. Max. memory is 16.1GB. [2025-01-09 08:21:02,164 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 83.9MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:21:02,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.60ms. Allocated memory is still 117.4MB. Free memory was 87.0MB in the beginning and 68.6MB in the end (delta: 18.4MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2025-01-09 08:21:02,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 173.72ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 67.6MB in the end (delta: 945.2kB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2025-01-09 08:21:02,164 INFO L158 Benchmark]: Boogie Preprocessor took 144.39ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 49.1MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:21:02,164 INFO L158 Benchmark]: RCFGBuilder took 2256.14ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 49.1MB in the beginning and 247.7MB in the end (delta: -198.6MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. [2025-01-09 08:21:02,164 INFO L158 Benchmark]: TraceAbstraction took 1306.43ms. Allocated memory is still 419.4MB. Free memory was 247.7MB in the beginning and 149.6MB in the end (delta: 98.2MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2025-01-09 08:21:02,165 INFO L158 Benchmark]: Witness Printer took 103.50ms. Allocated memory is still 419.4MB. Free memory was 149.6MB in the beginning and 138.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:21:02,166 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.85ms. Allocated memory is still 83.9MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 642.60ms. Allocated memory is still 117.4MB. Free memory was 87.0MB in the beginning and 68.6MB in the end (delta: 18.4MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 173.72ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 67.6MB in the end (delta: 945.2kB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.39ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 49.1MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2256.14ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 49.1MB in the beginning and 247.7MB in the end (delta: -198.6MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1306.43ms. Allocated memory is still 419.4MB. Free memory was 247.7MB in the beginning and 149.6MB in the end (delta: 98.2MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * Witness Printer took 103.50ms. Allocated memory is still 419.4MB. Free memory was 149.6MB in the beginning and 138.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a 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 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_25 mask_SORT_25 = (SORT_25)-1 >> (sizeof(SORT_25) * 8 - 4); [L33] const SORT_25 msb_SORT_25 = (SORT_25)1 << (4 - 1); [L35] const SORT_187 mask_SORT_187 = (SORT_187)-1 >> (sizeof(SORT_187) * 8 - 32); [L36] const SORT_187 msb_SORT_187 = (SORT_187)1 << (32 - 1); [L38] const SORT_195 mask_SORT_195 = (SORT_195)-1 >> (sizeof(SORT_195) * 8 - 3); [L39] const SORT_195 msb_SORT_195 = (SORT_195)1 << (3 - 1); [L41] const SORT_1 var_11 = 0; [L42] const SORT_3 var_14 = 2; [L43] const SORT_1 var_28 = 1; [L44] const SORT_187 var_189 = 1; [L45] const SORT_3 var_274 = 0; [L46] const SORT_3 var_275 = 3; [L47] const SORT_187 var_284 = 0; [L48] const SORT_187 var_495 = 2; [L50] SORT_1 input_2; [L51] SORT_3 input_4; [L52] SORT_3 input_5; [L53] SORT_1 input_6; [L54] SORT_3 input_7; [L55] SORT_1 input_8; [L56] SORT_1 input_9; [L57] SORT_1 input_181; [L58] SORT_3 input_273; [L59] SORT_3 input_289; [L60] SORT_3 input_290; [L61] SORT_3 input_291; [L62] SORT_3 input_292; [L63] SORT_3 input_319; [L64] SORT_3 input_320; [L65] SORT_3 input_321; [L66] SORT_3 input_330; [L67] SORT_3 input_384; [L68] SORT_3 input_396; [L69] SORT_3 input_397; [L70] SORT_3 input_398; [L71] SORT_3 input_399; [L72] SORT_3 input_408; [L73] SORT_3 input_429; [L74] SORT_3 input_430; [L75] SORT_3 input_431; [L76] SORT_3 input_440; [L77] SORT_3 input_442; [L78] SORT_3 input_488; [L79] SORT_3 input_502; [L80] SORT_3 input_503; [L81] SORT_3 input_504; [L82] SORT_3 input_505; [L83] SORT_3 input_514; [L84] SORT_3 input_516; [L85] SORT_3 input_538; [L86] SORT_3 input_539; [L87] SORT_3 input_540; [L88] SORT_3 input_549; [L89] SORT_3 input_551; [L90] SORT_3 input_553; [L91] SORT_3 input_599; [L92] SORT_3 input_610; [L93] SORT_3 input_611; [L94] SORT_3 input_612; [L95] SORT_3 input_620; [L96] SORT_3 input_622; [L97] SORT_3 input_624; [L98] SORT_3 input_644; [L99] SORT_3 input_645; [L100] SORT_3 input_653; [L101] SORT_3 input_655; [L102] SORT_3 input_657; [L103] SORT_3 input_659; [L105] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L107] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L108] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L109] SORT_3 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L110] SORT_25 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_25; [L111] SORT_25 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_25; [L112] SORT_3 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L113] SORT_3 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L114] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L115] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L116] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L117] SORT_3 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L118] SORT_3 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L119] SORT_3 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L120] SORT_3 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L121] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L122] SORT_3 state_79 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L123] SORT_3 state_82 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L124] SORT_3 state_148 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L125] SORT_3 state_149 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L126] SORT_3 state_150 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L127] SORT_3 state_151 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L128] SORT_3 state_152 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L129] SORT_3 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L130] SORT_3 state_154 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L131] SORT_3 state_155 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L132] SORT_3 state_156 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L133] SORT_3 state_157 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L134] SORT_3 state_158 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L135] SORT_3 state_159 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L136] SORT_3 state_160 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L137] SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L138] SORT_3 state_162 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L139] SORT_3 state_163 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L143] input_2 = __VERIFIER_nondet_uchar() [L144] input_2 = input_2 & mask_SORT_1 [L145] input_4 = __VERIFIER_nondet_uchar() [L146] input_5 = __VERIFIER_nondet_uchar() [L147] input_6 = __VERIFIER_nondet_uchar() [L148] input_7 = __VERIFIER_nondet_uchar() [L149] input_8 = __VERIFIER_nondet_uchar() [L150] input_9 = __VERIFIER_nondet_uchar() [L151] input_9 = input_9 & mask_SORT_1 [L152] input_181 = __VERIFIER_nondet_uchar() [L153] input_273 = __VERIFIER_nondet_uchar() [L154] input_289 = __VERIFIER_nondet_uchar() [L155] input_290 = __VERIFIER_nondet_uchar() [L156] input_291 = __VERIFIER_nondet_uchar() [L157] input_292 = __VERIFIER_nondet_uchar() [L158] input_319 = __VERIFIER_nondet_uchar() [L159] input_320 = __VERIFIER_nondet_uchar() [L160] input_321 = __VERIFIER_nondet_uchar() [L161] input_330 = __VERIFIER_nondet_uchar() [L162] input_384 = __VERIFIER_nondet_uchar() [L163] input_396 = __VERIFIER_nondet_uchar() [L164] input_397 = __VERIFIER_nondet_uchar() [L165] input_398 = __VERIFIER_nondet_uchar() [L166] input_399 = __VERIFIER_nondet_uchar() [L167] input_408 = __VERIFIER_nondet_uchar() [L168] input_429 = __VERIFIER_nondet_uchar() [L169] input_430 = __VERIFIER_nondet_uchar() [L170] input_431 = __VERIFIER_nondet_uchar() [L171] input_440 = __VERIFIER_nondet_uchar() [L172] input_442 = __VERIFIER_nondet_uchar() [L173] input_488 = __VERIFIER_nondet_uchar() [L174] input_502 = __VERIFIER_nondet_uchar() [L175] input_503 = __VERIFIER_nondet_uchar() [L176] input_504 = __VERIFIER_nondet_uchar() [L177] input_505 = __VERIFIER_nondet_uchar() [L178] input_514 = __VERIFIER_nondet_uchar() [L179] input_516 = __VERIFIER_nondet_uchar() [L180] input_538 = __VERIFIER_nondet_uchar() [L181] input_539 = __VERIFIER_nondet_uchar() [L182] input_540 = __VERIFIER_nondet_uchar() [L183] input_549 = __VERIFIER_nondet_uchar() [L184] input_551 = __VERIFIER_nondet_uchar() [L185] input_553 = __VERIFIER_nondet_uchar() [L186] input_599 = __VERIFIER_nondet_uchar() [L187] input_610 = __VERIFIER_nondet_uchar() [L188] input_611 = __VERIFIER_nondet_uchar() [L189] input_612 = __VERIFIER_nondet_uchar() [L190] input_620 = __VERIFIER_nondet_uchar() [L191] input_622 = __VERIFIER_nondet_uchar() [L192] input_624 = __VERIFIER_nondet_uchar() [L193] input_644 = __VERIFIER_nondet_uchar() [L194] input_645 = __VERIFIER_nondet_uchar() [L195] input_653 = __VERIFIER_nondet_uchar() [L196] input_655 = __VERIFIER_nondet_uchar() [L197] input_657 = __VERIFIER_nondet_uchar() [L198] input_659 = __VERIFIER_nondet_uchar() [L201] SORT_1 var_12_arg_0 = state_10; [L202] SORT_1 var_12_arg_1 = var_11; [L203] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L204] SORT_3 var_15_arg_0 = state_13; [L205] SORT_3 var_15_arg_1 = var_14; [L206] SORT_1 var_15 = var_15_arg_0 >= var_15_arg_1; [L207] SORT_3 var_17_arg_0 = state_16; [L208] SORT_3 var_17_arg_1 = var_14; [L209] SORT_1 var_17 = var_17_arg_0 >= var_17_arg_1; [L210] SORT_1 var_18_arg_0 = var_15; [L211] SORT_1 var_18_arg_1 = var_17; [L212] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L213] SORT_3 var_20_arg_0 = state_19; [L214] SORT_3 var_20_arg_1 = var_14; [L215] SORT_1 var_20 = var_20_arg_0 >= var_20_arg_1; [L216] SORT_1 var_21_arg_0 = var_18; [L217] SORT_1 var_21_arg_1 = var_20; [L218] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L219] SORT_3 var_23_arg_0 = state_22; [L220] SORT_3 var_23_arg_1 = var_14; [L221] SORT_1 var_23 = var_23_arg_0 >= var_23_arg_1; [L222] SORT_1 var_24_arg_0 = var_21; [L223] SORT_1 var_24_arg_1 = var_23; [L224] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L225] SORT_25 var_27_arg_0 = state_26; [L226] SORT_1 var_27 = var_27_arg_0 >> 3; [L227] var_27 = var_27 & mask_SORT_1 [L228] SORT_1 var_29_arg_0 = var_27; [L229] SORT_1 var_29_arg_1 = var_28; [L230] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L231] SORT_1 var_30_arg_0 = var_24; [L232] SORT_1 var_30_arg_1 = var_29; [L233] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L234] SORT_1 var_31_arg_0 = var_30; [L235] SORT_1 var_31 = ~var_31_arg_0; [L236] SORT_25 var_33_arg_0 = state_32; [L237] SORT_1 var_33 = var_33_arg_0 >> 3; [L238] var_33 = var_33 & mask_SORT_1 [L239] SORT_1 var_34_arg_0 = var_33; [L240] SORT_1 var_34_arg_1 = var_28; [L241] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L242] SORT_1 var_35_arg_0 = var_31; [L243] SORT_1 var_35_arg_1 = var_34; [L244] SORT_1 var_35 = var_35_arg_0 | var_35_arg_1; [L245] SORT_3 var_37_arg_0 = state_36; [L246] SORT_3 var_37_arg_1 = var_14; [L247] SORT_1 var_37 = var_37_arg_0 >= var_37_arg_1; [L248] SORT_3 var_39_arg_0 = state_38; [L249] SORT_3 var_39_arg_1 = var_14; [L250] SORT_1 var_39 = var_39_arg_0 >= var_39_arg_1; [L251] SORT_1 var_40_arg_0 = var_37; [L252] SORT_1 var_40_arg_1 = var_39; [L253] SORT_1 var_40 = var_40_arg_0 & var_40_arg_1; [L254] SORT_3 var_42_arg_0 = state_41; [L255] SORT_3 var_42_arg_1 = var_14; [L256] SORT_1 var_42 = var_42_arg_0 >= var_42_arg_1; [L257] SORT_1 var_43_arg_0 = var_40; [L258] SORT_1 var_43_arg_1 = var_42; [L259] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L260] SORT_3 var_45_arg_0 = state_44; [L261] SORT_3 var_45_arg_1 = var_14; [L262] SORT_1 var_45 = var_45_arg_0 >= var_45_arg_1; [L263] SORT_1 var_46_arg_0 = var_43; [L264] SORT_1 var_46_arg_1 = var_45; [L265] SORT_1 var_46 = var_46_arg_0 & var_46_arg_1; [L266] SORT_25 var_47_arg_0 = state_26; [L267] SORT_1 var_47 = var_47_arg_0 >> 2; [L268] var_47 = var_47 & mask_SORT_1 [L269] SORT_1 var_48_arg_0 = var_47; [L270] SORT_1 var_48_arg_1 = var_28; [L271] SORT_1 var_48 = var_48_arg_0 == var_48_arg_1; [L272] SORT_1 var_49_arg_0 = var_46; [L273] SORT_1 var_49_arg_1 = var_48; [L274] SORT_1 var_49 = var_49_arg_0 & var_49_arg_1; [L275] SORT_1 var_50_arg_0 = var_49; [L276] SORT_1 var_50 = ~var_50_arg_0; [L277] SORT_25 var_51_arg_0 = state_32; [L278] SORT_1 var_51 = var_51_arg_0 >> 2; [L279] var_51 = var_51 & mask_SORT_1 [L280] SORT_1 var_52_arg_0 = var_51; [L281] SORT_1 var_52_arg_1 = var_28; [L282] SORT_1 var_52 = var_52_arg_0 == var_52_arg_1; [L283] SORT_1 var_53_arg_0 = var_50; [L284] SORT_1 var_53_arg_1 = var_52; [L285] SORT_1 var_53 = var_53_arg_0 | var_53_arg_1; [L286] SORT_1 var_54_arg_0 = var_35; [L287] SORT_1 var_54_arg_1 = var_53; [L288] SORT_1 var_54 = var_54_arg_0 & var_54_arg_1; [L289] SORT_3 var_56_arg_0 = state_55; [L290] SORT_3 var_56_arg_1 = var_14; [L291] SORT_1 var_56 = var_56_arg_0 >= var_56_arg_1; [L292] SORT_3 var_58_arg_0 = state_57; [L293] SORT_3 var_58_arg_1 = var_14; [L294] SORT_1 var_58 = var_58_arg_0 >= var_58_arg_1; [L295] SORT_1 var_59_arg_0 = var_56; [L296] SORT_1 var_59_arg_1 = var_58; [L297] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L298] SORT_3 var_61_arg_0 = state_60; [L299] SORT_3 var_61_arg_1 = var_14; [L300] SORT_1 var_61 = var_61_arg_0 >= var_61_arg_1; [L301] SORT_1 var_62_arg_0 = var_59; [L302] SORT_1 var_62_arg_1 = var_61; [L303] SORT_1 var_62 = var_62_arg_0 & var_62_arg_1; [L304] SORT_3 var_64_arg_0 = state_63; [L305] SORT_3 var_64_arg_1 = var_14; [L306] SORT_1 var_64 = var_64_arg_0 >= var_64_arg_1; [L307] SORT_1 var_65_arg_0 = var_62; [L308] SORT_1 var_65_arg_1 = var_64; [L309] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L310] SORT_25 var_66_arg_0 = state_26; [L311] SORT_1 var_66 = var_66_arg_0 >> 1; [L312] var_66 = var_66 & mask_SORT_1 [L313] SORT_1 var_67_arg_0 = var_66; [L314] SORT_1 var_67_arg_1 = var_28; [L315] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L316] SORT_1 var_68_arg_0 = var_65; [L317] SORT_1 var_68_arg_1 = var_67; [L318] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L319] SORT_1 var_69_arg_0 = var_68; [L320] SORT_1 var_69 = ~var_69_arg_0; [L321] SORT_25 var_70_arg_0 = state_32; [L322] SORT_1 var_70 = var_70_arg_0 >> 1; [L323] var_70 = var_70 & mask_SORT_1 [L324] SORT_1 var_71_arg_0 = var_70; [L325] SORT_1 var_71_arg_1 = var_28; [L326] SORT_1 var_71 = var_71_arg_0 == var_71_arg_1; [L327] SORT_1 var_72_arg_0 = var_69; [L328] SORT_1 var_72_arg_1 = var_71; [L329] SORT_1 var_72 = var_72_arg_0 | var_72_arg_1; [L330] SORT_1 var_73_arg_0 = var_54; [L331] SORT_1 var_73_arg_1 = var_72; [L332] SORT_1 var_73 = var_73_arg_0 & var_73_arg_1; [L333] SORT_3 var_75_arg_0 = state_74; [L334] SORT_3 var_75_arg_1 = var_14; [L335] SORT_1 var_75 = var_75_arg_0 >= var_75_arg_1; [L336] SORT_3 var_77_arg_0 = state_76; [L337] SORT_3 var_77_arg_1 = var_14; [L338] SORT_1 var_77 = var_77_arg_0 >= var_77_arg_1; [L339] SORT_1 var_78_arg_0 = var_75; [L340] SORT_1 var_78_arg_1 = var_77; [L341] SORT_1 var_78 = var_78_arg_0 & var_78_arg_1; [L342] SORT_3 var_80_arg_0 = state_79; [L343] SORT_3 var_80_arg_1 = var_14; [L344] SORT_1 var_80 = var_80_arg_0 >= var_80_arg_1; [L345] SORT_1 var_81_arg_0 = var_78; [L346] SORT_1 var_81_arg_1 = var_80; [L347] SORT_1 var_81 = var_81_arg_0 & var_81_arg_1; [L348] SORT_3 var_83_arg_0 = state_82; [L349] SORT_3 var_83_arg_1 = var_14; [L350] SORT_1 var_83 = var_83_arg_0 >= var_83_arg_1; [L351] SORT_1 var_84_arg_0 = var_81; [L352] SORT_1 var_84_arg_1 = var_83; [L353] SORT_1 var_84 = var_84_arg_0 & var_84_arg_1; [L354] SORT_25 var_85_arg_0 = state_26; [L355] SORT_1 var_85 = var_85_arg_0 >> 0; [L356] var_85 = var_85 & mask_SORT_1 [L357] SORT_1 var_86_arg_0 = var_85; [L358] SORT_1 var_86_arg_1 = var_28; [L359] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L360] SORT_1 var_87_arg_0 = var_84; [L361] SORT_1 var_87_arg_1 = var_86; [L362] SORT_1 var_87 = var_87_arg_0 & var_87_arg_1; [L363] SORT_1 var_88_arg_0 = var_87; [L364] SORT_1 var_88 = ~var_88_arg_0; [L365] SORT_25 var_89_arg_0 = state_32; [L366] SORT_1 var_89 = var_89_arg_0 >> 0; [L367] var_89 = var_89 & mask_SORT_1 [L368] SORT_1 var_90_arg_0 = var_89; [L369] SORT_1 var_90_arg_1 = var_28; [L370] SORT_1 var_90 = var_90_arg_0 == var_90_arg_1; [L371] SORT_1 var_91_arg_0 = var_88; [L372] SORT_1 var_91_arg_1 = var_90; [L373] SORT_1 var_91 = var_91_arg_0 | var_91_arg_1; [L374] SORT_1 var_92_arg_0 = var_73; [L375] SORT_1 var_92_arg_1 = var_91; [L376] SORT_1 var_92 = var_92_arg_0 & var_92_arg_1; [L377] SORT_3 var_93_arg_0 = state_13; [L378] SORT_3 var_93_arg_1 = var_14; [L379] SORT_1 var_93 = var_93_arg_0 >= var_93_arg_1; [L380] SORT_3 var_94_arg_0 = state_16; [L381] SORT_3 var_94_arg_1 = var_14; [L382] SORT_1 var_94 = var_94_arg_0 >= var_94_arg_1; [L383] SORT_1 var_95_arg_0 = var_93; [L384] SORT_1 var_95_arg_1 = var_94; [L385] SORT_1 var_95 = var_95_arg_0 | var_95_arg_1; [L386] SORT_3 var_96_arg_0 = state_19; [L387] SORT_3 var_96_arg_1 = var_14; [L388] SORT_1 var_96 = var_96_arg_0 >= var_96_arg_1; [L389] SORT_1 var_97_arg_0 = var_95; [L390] SORT_1 var_97_arg_1 = var_96; [L391] SORT_1 var_97 = var_97_arg_0 | var_97_arg_1; [L392] SORT_3 var_98_arg_0 = state_22; [L393] SORT_3 var_98_arg_1 = var_14; [L394] SORT_1 var_98 = var_98_arg_0 >= var_98_arg_1; [L395] SORT_1 var_99_arg_0 = var_97; [L396] SORT_1 var_99_arg_1 = var_98; [L397] SORT_1 var_99 = var_99_arg_0 | var_99_arg_1; [L398] SORT_1 var_100_arg_0 = var_27; [L399] SORT_1 var_100_arg_1 = var_28; [L400] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L401] SORT_1 var_101_arg_0 = var_99; [L402] SORT_1 var_101_arg_1 = var_100; [L403] SORT_1 var_101 = var_101_arg_0 | var_101_arg_1; [L404] SORT_1 var_102_arg_0 = var_33; [L405] SORT_1 var_102_arg_1 = var_11; [L406] SORT_1 var_102 = var_102_arg_0 == var_102_arg_1; [L407] SORT_1 var_103_arg_0 = var_101; [L408] SORT_1 var_103_arg_1 = var_102; [L409] SORT_1 var_103 = var_103_arg_0 | var_103_arg_1; [L410] SORT_1 var_104_arg_0 = var_92; [L411] SORT_1 var_104_arg_1 = var_103; [L412] SORT_1 var_104 = var_104_arg_0 & var_104_arg_1; [L413] SORT_3 var_105_arg_0 = state_36; [L414] SORT_3 var_105_arg_1 = var_14; [L415] SORT_1 var_105 = var_105_arg_0 >= var_105_arg_1; [L416] SORT_3 var_106_arg_0 = state_38; [L417] SORT_3 var_106_arg_1 = var_14; [L418] SORT_1 var_106 = var_106_arg_0 >= var_106_arg_1; [L419] SORT_1 var_107_arg_0 = var_105; [L420] SORT_1 var_107_arg_1 = var_106; [L421] SORT_1 var_107 = var_107_arg_0 | var_107_arg_1; [L422] SORT_3 var_108_arg_0 = state_41; [L423] SORT_3 var_108_arg_1 = var_14; [L424] SORT_1 var_108 = var_108_arg_0 >= var_108_arg_1; [L425] SORT_1 var_109_arg_0 = var_107; [L426] SORT_1 var_109_arg_1 = var_108; [L427] SORT_1 var_109 = var_109_arg_0 | var_109_arg_1; [L428] SORT_3 var_110_arg_0 = state_44; [L429] SORT_3 var_110_arg_1 = var_14; [L430] SORT_1 var_110 = var_110_arg_0 >= var_110_arg_1; [L431] SORT_1 var_111_arg_0 = var_109; [L432] SORT_1 var_111_arg_1 = var_110; [L433] SORT_1 var_111 = var_111_arg_0 | var_111_arg_1; [L434] SORT_1 var_112_arg_0 = var_47; [L435] SORT_1 var_112_arg_1 = var_28; [L436] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L437] SORT_1 var_113_arg_0 = var_111; [L438] SORT_1 var_113_arg_1 = var_112; [L439] SORT_1 var_113 = var_113_arg_0 | var_113_arg_1; [L440] SORT_1 var_114_arg_0 = var_51; [L441] SORT_1 var_114_arg_1 = var_11; [L442] SORT_1 var_114 = var_114_arg_0 == var_114_arg_1; [L443] SORT_1 var_115_arg_0 = var_113; [L444] SORT_1 var_115_arg_1 = var_114; [L445] SORT_1 var_115 = var_115_arg_0 | var_115_arg_1; [L446] SORT_1 var_116_arg_0 = var_104; [L447] SORT_1 var_116_arg_1 = var_115; [L448] SORT_1 var_116 = var_116_arg_0 & var_116_arg_1; [L449] SORT_3 var_117_arg_0 = state_55; [L450] SORT_3 var_117_arg_1 = var_14; [L451] SORT_1 var_117 = var_117_arg_0 >= var_117_arg_1; [L452] SORT_3 var_118_arg_0 = state_57; [L453] SORT_3 var_118_arg_1 = var_14; [L454] SORT_1 var_118 = var_118_arg_0 >= var_118_arg_1; [L455] SORT_1 var_119_arg_0 = var_117; [L456] SORT_1 var_119_arg_1 = var_118; [L457] SORT_1 var_119 = var_119_arg_0 | var_119_arg_1; [L458] SORT_3 var_120_arg_0 = state_60; [L459] SORT_3 var_120_arg_1 = var_14; [L460] SORT_1 var_120 = var_120_arg_0 >= var_120_arg_1; [L461] SORT_1 var_121_arg_0 = var_119; [L462] SORT_1 var_121_arg_1 = var_120; [L463] SORT_1 var_121 = var_121_arg_0 | var_121_arg_1; [L464] SORT_3 var_122_arg_0 = state_63; [L465] SORT_3 var_122_arg_1 = var_14; [L466] SORT_1 var_122 = var_122_arg_0 >= var_122_arg_1; [L467] SORT_1 var_123_arg_0 = var_121; [L468] SORT_1 var_123_arg_1 = var_122; [L469] SORT_1 var_123 = var_123_arg_0 | var_123_arg_1; [L470] SORT_1 var_124_arg_0 = var_66; [L471] SORT_1 var_124_arg_1 = var_28; [L472] SORT_1 var_124 = var_124_arg_0 == var_124_arg_1; [L473] SORT_1 var_125_arg_0 = var_123; [L474] SORT_1 var_125_arg_1 = var_124; [L475] SORT_1 var_125 = var_125_arg_0 | var_125_arg_1; [L476] SORT_1 var_126_arg_0 = var_70; [L477] SORT_1 var_126_arg_1 = var_11; [L478] SORT_1 var_126 = var_126_arg_0 == var_126_arg_1; [L479] SORT_1 var_127_arg_0 = var_125; [L480] SORT_1 var_127_arg_1 = var_126; [L481] SORT_1 var_127 = var_127_arg_0 | var_127_arg_1; [L482] SORT_1 var_128_arg_0 = var_116; [L483] SORT_1 var_128_arg_1 = var_127; [L484] SORT_1 var_128 = var_128_arg_0 & var_128_arg_1; [L485] SORT_3 var_129_arg_0 = state_74; [L486] SORT_3 var_129_arg_1 = var_14; [L487] SORT_1 var_129 = var_129_arg_0 >= var_129_arg_1; [L488] SORT_3 var_130_arg_0 = state_76; [L489] SORT_3 var_130_arg_1 = var_14; [L490] SORT_1 var_130 = var_130_arg_0 >= var_130_arg_1; [L491] SORT_1 var_131_arg_0 = var_129; [L492] SORT_1 var_131_arg_1 = var_130; [L493] SORT_1 var_131 = var_131_arg_0 | var_131_arg_1; [L494] SORT_3 var_132_arg_0 = state_79; [L495] SORT_3 var_132_arg_1 = var_14; [L496] SORT_1 var_132 = var_132_arg_0 >= var_132_arg_1; [L497] SORT_1 var_133_arg_0 = var_131; [L498] SORT_1 var_133_arg_1 = var_132; [L499] SORT_1 var_133 = var_133_arg_0 | var_133_arg_1; [L500] SORT_3 var_134_arg_0 = state_82; [L501] SORT_3 var_134_arg_1 = var_14; [L502] SORT_1 var_134 = var_134_arg_0 >= var_134_arg_1; [L503] SORT_1 var_135_arg_0 = var_133; [L504] SORT_1 var_135_arg_1 = var_134; [L505] SORT_1 var_135 = var_135_arg_0 | var_135_arg_1; [L506] SORT_1 var_136_arg_0 = var_85; [L507] SORT_1 var_136_arg_1 = var_28; [L508] SORT_1 var_136 = var_136_arg_0 == var_136_arg_1; [L509] SORT_1 var_137_arg_0 = var_135; [L510] SORT_1 var_137_arg_1 = var_136; [L511] SORT_1 var_137 = var_137_arg_0 | var_137_arg_1; [L512] SORT_1 var_138_arg_0 = var_89; [L513] SORT_1 var_138_arg_1 = var_11; [L514] SORT_1 var_138 = var_138_arg_0 == var_138_arg_1; [L515] SORT_1 var_139_arg_0 = var_137; [L516] SORT_1 var_139_arg_1 = var_138; [L517] SORT_1 var_139 = var_139_arg_0 | var_139_arg_1; [L518] SORT_1 var_140_arg_0 = var_128; [L519] SORT_1 var_140_arg_1 = var_139; [L520] SORT_1 var_140 = var_140_arg_0 & var_140_arg_1; [L521] SORT_1 var_141_arg_0 = var_12; [L522] SORT_1 var_141_arg_1 = var_140; [L523] SORT_1 var_141 = var_141_arg_0 | var_141_arg_1; [L524] SORT_1 var_144_arg_0 = var_141; [L525] SORT_1 var_144 = ~var_144_arg_0; [L526] SORT_1 var_145_arg_0 = var_28; [L527] SORT_1 var_145_arg_1 = var_144; [L528] SORT_1 var_145 = var_145_arg_0 & var_145_arg_1; [L529] var_145 = var_145 & mask_SORT_1 [L530] SORT_1 bad_146_arg_0 = var_145; [L531] CALL __VERIFIER_assert(!(bad_146_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 proved your program to be incorrect! [2025-01-09 08:21:02,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE