./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.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_vsaR_p08.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 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:22:13,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:22:13,672 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:22:13,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:22:13,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:22:13,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:22:13,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:22:13,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:22:13,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:22:13,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:22:13,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:22:13,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:22:13,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:22:13,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:22:13,710 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:22:13,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:22:13,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:22:13,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:22:13,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:22:13,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:22:13,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:22:13,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:22:13,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:22:13,712 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:22:13,712 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:22:13,712 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:22:13,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:22:13,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:22:13,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:22:13,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:22:13,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:22:13,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:22:13,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:22:13,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:22:13,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:22:13,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:22:13,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:22:13,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:22:13,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:22:13,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:22:13,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:22:13,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:22:13,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:22:13,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:22:13,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:22:13,714 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 -> 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e [2025-01-09 08:22:13,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:22:14,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:22:14,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:22:14,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:22:14,008 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:22:14,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-01-09 08:22:15,409 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ee8487c8/fbdf462b61294c09b760ca4dbac4de84/FLAGcf6d4ca9f [2025-01-09 08:22:15,759 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:22:15,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-01-09 08:22:15,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ee8487c8/fbdf462b61294c09b760ca4dbac4de84/FLAGcf6d4ca9f [2025-01-09 08:22:15,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ee8487c8/fbdf462b61294c09b760ca4dbac4de84 [2025-01-09 08:22:15,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:22:15,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:22:15,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:22:15,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:22:15,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:22:15,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:22:15" (1/1) ... [2025-01-09 08:22:15,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec95e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:15, skipping insertion in model container [2025-01-09 08:22:15,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:22:15" (1/1) ... [2025-01-09 08:22:15,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:22:16,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-01-09 08:22:16,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:22:16,302 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:22:16,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-01-09 08:22:16,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:22:16,468 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:22:16,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16 WrapperNode [2025-01-09 08:22:16,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:22:16,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:22:16,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:22:16,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:22:16,476 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:22:16" (1/1) ... [2025-01-09 08:22:16,534 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:22:16" (1/1) ... [2025-01-09 08:22:16,778 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2601 [2025-01-09 08:22:16,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:22:16,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:22:16,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:22:16,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:22:16,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:16,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:16,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:16,976 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:22:16,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:16,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:17,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:17,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:17,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:17,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:17,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:17,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:22:17,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:22:17,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:22:17,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:22:17,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (1/1) ... [2025-01-09 08:22:17,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:22:17,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:22:17,274 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:22:17,278 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:22:17,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:22:17,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:22:17,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:22:17,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:22:17,649 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:22:17,651 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:22:20,568 INFO L? ?]: Removed 1628 outVars from TransFormulas that were not future-live. [2025-01-09 08:22:20,568 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:22:20,615 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:22:20,615 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:22:20,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:22:20 BoogieIcfgContainer [2025-01-09 08:22:20,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:22:20,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:22:20,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:22:20,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:22:20,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:22:15" (1/3) ... [2025-01-09 08:22:20,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4bd16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:22:20, skipping insertion in model container [2025-01-09 08:22:20,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:16" (2/3) ... [2025-01-09 08:22:20,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4bd16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:22:20, skipping insertion in model container [2025-01-09 08:22:20,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:22:20" (3/3) ... [2025-01-09 08:22:20,639 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-01-09 08:22:20,652 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:22:20,654 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c that has 1 procedures, 683 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:22:20,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:22:20,807 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;@775fb684, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:22:20,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:22:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 683 states, 681 states have (on average 1.499265785609398) internal successors, (1021), 682 states have internal predecessors, (1021), 0 states have call successors, (0), 0 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:22:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 08:22:20,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:20,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:20,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:20,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2082529394, now seen corresponding path program 1 times [2025-01-09 08:22:20,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:20,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155378197] [2025-01-09 08:22:20,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:20,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 08:22:21,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 08:22:21,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:21,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:22,322 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:22:22,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:22,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155378197] [2025-01-09 08:22:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155378197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:22,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:22:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176586387] [2025-01-09 08:22:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:22,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:22:22,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:22,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:22:22,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:22:22,354 INFO L87 Difference]: Start difference. First operand has 683 states, 681 states have (on average 1.499265785609398) internal successors, (1021), 682 states have internal predecessors, (1021), 0 states have call successors, (0), 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 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:22:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:22,494 INFO L93 Difference]: Finished difference Result 1311 states and 1963 transitions. [2025-01-09 08:22:22,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:22:22,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-01-09 08:22:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:22,515 INFO L225 Difference]: With dead ends: 1311 [2025-01-09 08:22:22,516 INFO L226 Difference]: Without dead ends: 682 [2025-01-09 08:22:22,523 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:22:22,528 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 0 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3039 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:22:22,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3039 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-01-09 08:22:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-01-09 08:22:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.4963289280469898) internal successors, (1019), 681 states have internal predecessors, (1019), 0 states have call successors, (0), 0 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:22:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1019 transitions. [2025-01-09 08:22:22,607 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1019 transitions. Word has length 121 [2025-01-09 08:22:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:22,608 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1019 transitions. [2025-01-09 08:22:22,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:22:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1019 transitions. [2025-01-09 08:22:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 08:22:22,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:22,613 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] [2025-01-09 08:22:22,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:22:22,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:22,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash -132205867, now seen corresponding path program 1 times [2025-01-09 08:22:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:22,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028536264] [2025-01-09 08:22:22,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:22,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 08:22:22,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 08:22:22,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:22,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:23,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:23,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028536264] [2025-01-09 08:22:23,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028536264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:22:23,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423345654] [2025-01-09 08:22:23,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:23,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:22:23,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:23,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:22:23,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:22:23,188 INFO L87 Difference]: Start difference. First operand 682 states and 1019 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:22:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:23,257 INFO L93 Difference]: Finished difference Result 1312 states and 1961 transitions. [2025-01-09 08:22:23,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:22:23,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-01-09 08:22:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:23,263 INFO L225 Difference]: With dead ends: 1312 [2025-01-09 08:22:23,264 INFO L226 Difference]: Without dead ends: 684 [2025-01-09 08:22:23,266 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:22:23,269 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 0 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3035 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:22:23,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3035 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-01-09 08:22:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2025-01-09 08:22:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.4948755490483163) internal successors, (1021), 683 states have internal predecessors, (1021), 0 states have call successors, (0), 0 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:22:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1021 transitions. [2025-01-09 08:22:23,297 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1021 transitions. Word has length 122 [2025-01-09 08:22:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:23,298 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1021 transitions. [2025-01-09 08:22:23,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:22:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1021 transitions. [2025-01-09 08:22:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 08:22:23,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:23,302 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] [2025-01-09 08:22:23,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:22:23,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:23,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash -901379769, now seen corresponding path program 1 times [2025-01-09 08:22:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:23,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692207826] [2025-01-09 08:22:23,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:23,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 08:22:23,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 08:22:23,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:23,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692207826] [2025-01-09 08:22:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692207826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:24,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:22:24,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439308426] [2025-01-09 08:22:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:24,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:22:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:24,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:22:24,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:24,382 INFO L87 Difference]: Start difference. First operand 684 states and 1021 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:22:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:24,474 INFO L93 Difference]: Finished difference Result 1454 states and 2172 transitions. [2025-01-09 08:22:24,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:22:24,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-01-09 08:22:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:24,482 INFO L225 Difference]: With dead ends: 1454 [2025-01-09 08:22:24,482 INFO L226 Difference]: Without dead ends: 824 [2025-01-09 08:22:24,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:24,484 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 137 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:24,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 4241 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-01-09 08:22:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 821. [2025-01-09 08:22:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 1.4939024390243902) internal successors, (1225), 820 states have internal predecessors, (1225), 0 states have call successors, (0), 0 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:22:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1225 transitions. [2025-01-09 08:22:24,506 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1225 transitions. Word has length 123 [2025-01-09 08:22:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:24,507 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1225 transitions. [2025-01-09 08:22:24,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:22:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1225 transitions. [2025-01-09 08:22:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 08:22:24,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:24,511 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] [2025-01-09 08:22:24,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:22:24,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:24,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1264081508, now seen corresponding path program 1 times [2025-01-09 08:22:24,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:24,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372700832] [2025-01-09 08:22:24,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:24,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:24,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 08:22:24,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 08:22:24,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:24,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:25,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:25,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372700832] [2025-01-09 08:22:25,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372700832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:25,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:25,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:22:25,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687109639] [2025-01-09 08:22:25,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:25,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:22:25,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:25,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:22:25,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:25,434 INFO L87 Difference]: Start difference. First operand 821 states and 1225 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:22:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:25,551 INFO L93 Difference]: Finished difference Result 1596 states and 2382 transitions. [2025-01-09 08:22:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:22:25,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-01-09 08:22:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:25,557 INFO L225 Difference]: With dead ends: 1596 [2025-01-09 08:22:25,557 INFO L226 Difference]: Without dead ends: 829 [2025-01-09 08:22:25,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:25,559 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 137 mSDsluCounter, 5030 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 6039 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:25,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 6039 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-01-09 08:22:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 828. [2025-01-09 08:22:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.4933494558645708) internal successors, (1235), 827 states have internal predecessors, (1235), 0 states have call successors, (0), 0 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:22:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1235 transitions. [2025-01-09 08:22:25,619 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1235 transitions. Word has length 124 [2025-01-09 08:22:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:25,620 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1235 transitions. [2025-01-09 08:22:25,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:22:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1235 transitions. [2025-01-09 08:22:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 08:22:25,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:25,623 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] [2025-01-09 08:22:25,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:22:25,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:25,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash -746701423, now seen corresponding path program 1 times [2025-01-09 08:22:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:25,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638837029] [2025-01-09 08:22:25,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:25,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 08:22:25,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 08:22:25,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:25,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:26,203 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:22:26,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:26,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638837029] [2025-01-09 08:22:26,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638837029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:26,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:26,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:22:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177835384] [2025-01-09 08:22:26,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:26,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:22:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:26,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:22:26,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:26,206 INFO L87 Difference]: Start difference. First operand 828 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:22:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:26,317 INFO L93 Difference]: Finished difference Result 1620 states and 2417 transitions. [2025-01-09 08:22:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:26,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-01-09 08:22:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:26,322 INFO L225 Difference]: With dead ends: 1620 [2025-01-09 08:22:26,322 INFO L226 Difference]: Without dead ends: 846 [2025-01-09 08:22:26,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:26,324 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 16 mSDsluCounter, 4038 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5052 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:22:26,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5052 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-01-09 08:22:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2025-01-09 08:22:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.4923076923076923) internal successors, (1261), 845 states have internal predecessors, (1261), 0 states have call successors, (0), 0 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:22:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1261 transitions. [2025-01-09 08:22:26,348 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1261 transitions. Word has length 124 [2025-01-09 08:22:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:26,348 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1261 transitions. [2025-01-09 08:22:26,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:22:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1261 transitions. [2025-01-09 08:22:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 08:22:26,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:26,351 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] [2025-01-09 08:22:26,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:22:26,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:26,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:26,352 INFO L85 PathProgramCache]: Analyzing trace with hash 662856900, now seen corresponding path program 1 times [2025-01-09 08:22:26,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:26,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389781738] [2025-01-09 08:22:26,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:26,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:26,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 08:22:26,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 08:22:26,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:26,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:27,523 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:22:27,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:27,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389781738] [2025-01-09 08:22:27,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389781738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:27,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:27,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:22:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144043994] [2025-01-09 08:22:27,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:27,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:22:27,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:27,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:22:27,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:22:27,526 INFO L87 Difference]: Start difference. First operand 846 states and 1261 transitions. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:22:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:27,685 INFO L93 Difference]: Finished difference Result 1656 states and 2469 transitions. [2025-01-09 08:22:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:22:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-01-09 08:22:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:27,689 INFO L225 Difference]: With dead ends: 1656 [2025-01-09 08:22:27,690 INFO L226 Difference]: Without dead ends: 864 [2025-01-09 08:22:27,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:22:27,692 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 993 mSDsluCounter, 5025 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 6035 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:27,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 6035 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-01-09 08:22:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 860. [2025-01-09 08:22:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 1.491268917345751) internal successors, (1281), 859 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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:22:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1281 transitions. [2025-01-09 08:22:27,713 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1281 transitions. Word has length 125 [2025-01-09 08:22:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:27,713 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1281 transitions. [2025-01-09 08:22:27,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:22:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1281 transitions. [2025-01-09 08:22:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 08:22:27,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:27,715 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] [2025-01-09 08:22:27,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:22:27,716 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:27,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:27,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1193036640, now seen corresponding path program 1 times [2025-01-09 08:22:27,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:27,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307162837] [2025-01-09 08:22:27,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:27,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:27,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 08:22:27,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 08:22:27,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:27,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:28,124 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:22:28,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:28,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307162837] [2025-01-09 08:22:28,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307162837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:28,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:28,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:22:28,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838057316] [2025-01-09 08:22:28,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:28,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:22:28,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:28,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:22:28,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:28,126 INFO L87 Difference]: Start difference. First operand 860 states and 1281 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:22:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:28,192 INFO L93 Difference]: Finished difference Result 1678 states and 2500 transitions. [2025-01-09 08:22:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:28,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-01-09 08:22:28,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:28,196 INFO L225 Difference]: With dead ends: 1678 [2025-01-09 08:22:28,196 INFO L226 Difference]: Without dead ends: 872 [2025-01-09 08:22:28,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:28,198 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 4 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:28,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4044 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-01-09 08:22:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-01-09 08:22:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 1.4890929965556832) internal successors, (1297), 871 states have internal predecessors, (1297), 0 states have call successors, (0), 0 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:22:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1297 transitions. [2025-01-09 08:22:28,217 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1297 transitions. Word has length 126 [2025-01-09 08:22:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:28,217 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1297 transitions. [2025-01-09 08:22:28,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:22:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1297 transitions. [2025-01-09 08:22:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 08:22:28,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:28,219 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] [2025-01-09 08:22:28,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:22:28,220 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:28,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash 478874893, now seen corresponding path program 1 times [2025-01-09 08:22:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:28,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842182600] [2025-01-09 08:22:28,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:28,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:28,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 08:22:28,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 08:22:28,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:28,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:29,146 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:22:29,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:29,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842182600] [2025-01-09 08:22:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842182600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:22:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746964048] [2025-01-09 08:22:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:29,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:22:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:29,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:22:29,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:29,148 INFO L87 Difference]: Start difference. First operand 872 states and 1297 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:22:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:29,352 INFO L93 Difference]: Finished difference Result 2038 states and 3027 transitions. [2025-01-09 08:22:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:22:29,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-01-09 08:22:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:29,358 INFO L225 Difference]: With dead ends: 2038 [2025-01-09 08:22:29,358 INFO L226 Difference]: Without dead ends: 1220 [2025-01-09 08:22:29,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:22:29,360 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 1954 mSDsluCounter, 3995 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 4998 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:29,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 4998 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-01-09 08:22:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 878. [2025-01-09 08:22:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 1.4880273660205245) internal successors, (1305), 877 states have internal predecessors, (1305), 0 states have call successors, (0), 0 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:22:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1305 transitions. [2025-01-09 08:22:29,384 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1305 transitions. Word has length 126 [2025-01-09 08:22:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:29,384 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1305 transitions. [2025-01-09 08:22:29,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:22:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1305 transitions. [2025-01-09 08:22:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 08:22:29,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:29,386 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] [2025-01-09 08:22:29,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:22:29,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:29,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1718127690, now seen corresponding path program 1 times [2025-01-09 08:22:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:29,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514627567] [2025-01-09 08:22:29,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:29,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:29,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 08:22:29,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 08:22:29,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:29,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:29,793 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:22:29,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:29,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514627567] [2025-01-09 08:22:29,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514627567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:29,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:29,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:22:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807887557] [2025-01-09 08:22:29,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:29,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:22:29,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:29,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:22:29,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:29,795 INFO L87 Difference]: Start difference. First operand 878 states and 1305 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:22:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:29,852 INFO L93 Difference]: Finished difference Result 1738 states and 2584 transitions. [2025-01-09 08:22:29,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:29,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-01-09 08:22:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:29,857 INFO L225 Difference]: With dead ends: 1738 [2025-01-09 08:22:29,857 INFO L226 Difference]: Without dead ends: 914 [2025-01-09 08:22:29,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:29,859 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 16 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:29,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4044 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-01-09 08:22:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2025-01-09 08:22:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 1.4863088718510404) internal successors, (1357), 913 states have internal predecessors, (1357), 0 states have call successors, (0), 0 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:22:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1357 transitions. [2025-01-09 08:22:29,879 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1357 transitions. Word has length 127 [2025-01-09 08:22:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:29,879 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1357 transitions. [2025-01-09 08:22:29,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:22:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1357 transitions. [2025-01-09 08:22:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 08:22:29,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:29,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:29,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:22:29,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:29,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1619991794, now seen corresponding path program 1 times [2025-01-09 08:22:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599764549] [2025-01-09 08:22:29,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:29,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:29,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 08:22:29,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 08:22:29,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:29,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:30,417 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:22:30,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:30,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599764549] [2025-01-09 08:22:30,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599764549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:30,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:30,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:30,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672525958] [2025-01-09 08:22:30,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:30,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:30,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:30,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:30,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:30,419 INFO L87 Difference]: Start difference. First operand 914 states and 1357 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:22:30,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:30,524 INFO L93 Difference]: Finished difference Result 1778 states and 2639 transitions. [2025-01-09 08:22:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:30,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-01-09 08:22:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:30,529 INFO L225 Difference]: With dead ends: 1778 [2025-01-09 08:22:30,529 INFO L226 Difference]: Without dead ends: 918 [2025-01-09 08:22:30,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:30,531 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 986 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 3002 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:30,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 3002 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-01-09 08:22:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 914. [2025-01-09 08:22:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 1.4863088718510404) internal successors, (1357), 913 states have internal predecessors, (1357), 0 states have call successors, (0), 0 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:22:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1357 transitions. [2025-01-09 08:22:30,553 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1357 transitions. Word has length 127 [2025-01-09 08:22:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:30,553 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1357 transitions. [2025-01-09 08:22:30,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:22:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1357 transitions. [2025-01-09 08:22:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 08:22:30,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:30,555 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] [2025-01-09 08:22:30,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:22:30,556 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:30,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:30,556 INFO L85 PathProgramCache]: Analyzing trace with hash -791374141, now seen corresponding path program 1 times [2025-01-09 08:22:30,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:30,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986573082] [2025-01-09 08:22:30,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:30,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:30,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:22:30,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:22:30,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:30,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:31,047 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:22:31,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:31,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986573082] [2025-01-09 08:22:31,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986573082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:31,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:31,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:22:31,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856847480] [2025-01-09 08:22:31,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:31,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:22:31,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:31,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:22:31,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:31,049 INFO L87 Difference]: Start difference. First operand 914 states and 1357 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:22:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:31,104 INFO L93 Difference]: Finished difference Result 1786 states and 2652 transitions. [2025-01-09 08:22:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:31,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-01-09 08:22:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:31,108 INFO L225 Difference]: With dead ends: 1786 [2025-01-09 08:22:31,108 INFO L226 Difference]: Without dead ends: 926 [2025-01-09 08:22:31,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:31,110 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 4 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:31,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4044 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-01-09 08:22:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2025-01-09 08:22:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 1.4843243243243243) internal successors, (1373), 925 states have internal predecessors, (1373), 0 states have call successors, (0), 0 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:22:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1373 transitions. [2025-01-09 08:22:31,130 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1373 transitions. Word has length 128 [2025-01-09 08:22:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:31,130 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1373 transitions. [2025-01-09 08:22:31,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:22:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1373 transitions. [2025-01-09 08:22:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 08:22:31,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:31,133 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] [2025-01-09 08:22:31,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:22:31,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:31,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:31,134 INFO L85 PathProgramCache]: Analyzing trace with hash 690658836, now seen corresponding path program 1 times [2025-01-09 08:22:31,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:31,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662280881] [2025-01-09 08:22:31,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:31,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:31,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 08:22:31,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 08:22:31,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:31,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:31,951 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:22:31,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:31,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662280881] [2025-01-09 08:22:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662280881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:31,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:31,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:22:31,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482782438] [2025-01-09 08:22:31,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:31,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:22:31,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:31,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:22:31,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:31,954 INFO L87 Difference]: Start difference. First operand 926 states and 1373 transitions. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:22:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:32,461 INFO L93 Difference]: Finished difference Result 2172 states and 3215 transitions. [2025-01-09 08:22:32,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:22:32,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-01-09 08:22:32,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:32,468 INFO L225 Difference]: With dead ends: 2172 [2025-01-09 08:22:32,468 INFO L226 Difference]: Without dead ends: 1300 [2025-01-09 08:22:32,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:22:32,470 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 1468 mSDsluCounter, 5251 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 6686 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:32,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 6686 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:22:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-01-09 08:22:32,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 926. [2025-01-09 08:22:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 1.4843243243243243) internal successors, (1373), 925 states have internal predecessors, (1373), 0 states have call successors, (0), 0 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:22:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1373 transitions. [2025-01-09 08:22:32,496 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1373 transitions. Word has length 128 [2025-01-09 08:22:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:32,497 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1373 transitions. [2025-01-09 08:22:32,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:22:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1373 transitions. [2025-01-09 08:22:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 08:22:32,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:32,499 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] [2025-01-09 08:22:32,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:22:32,499 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:32,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1271612856, now seen corresponding path program 1 times [2025-01-09 08:22:32,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:32,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804848037] [2025-01-09 08:22:32,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:32,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:32,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 08:22:32,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 08:22:32,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:32,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804848037] [2025-01-09 08:22:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804848037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:32,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:32,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:32,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563196407] [2025-01-09 08:22:32,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:32,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:32,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:32,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:32,813 INFO L87 Difference]: Start difference. First operand 926 states and 1373 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:22:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:32,863 INFO L93 Difference]: Finished difference Result 1834 states and 2720 transitions. [2025-01-09 08:22:32,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:32,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-01-09 08:22:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:32,869 INFO L225 Difference]: With dead ends: 1834 [2025-01-09 08:22:32,869 INFO L226 Difference]: Without dead ends: 962 [2025-01-09 08:22:32,871 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:22:32,872 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 16 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4044 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:22:32,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4044 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-01-09 08:22:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2025-01-09 08:22:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.4828303850156088) internal successors, (1425), 961 states have internal predecessors, (1425), 0 states have call successors, (0), 0 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:22:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1425 transitions. [2025-01-09 08:22:32,894 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1425 transitions. Word has length 129 [2025-01-09 08:22:32,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:32,895 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1425 transitions. [2025-01-09 08:22:32,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:22:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1425 transitions. [2025-01-09 08:22:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 08:22:32,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:32,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:32,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:22:32,898 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:32,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash -772264682, now seen corresponding path program 1 times [2025-01-09 08:22:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376672202] [2025-01-09 08:22:32,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:32,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:32,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 08:22:33,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 08:22:33,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:33,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:33,543 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:22:33,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:33,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376672202] [2025-01-09 08:22:33,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376672202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:33,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:33,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:33,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271567222] [2025-01-09 08:22:33,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:33,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:33,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:33,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:33,545 INFO L87 Difference]: Start difference. First operand 962 states and 1425 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:22:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:33,800 INFO L93 Difference]: Finished difference Result 2206 states and 3261 transitions. [2025-01-09 08:22:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-01-09 08:22:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:33,807 INFO L225 Difference]: With dead ends: 2206 [2025-01-09 08:22:33,807 INFO L226 Difference]: Without dead ends: 1298 [2025-01-09 08:22:33,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:33,809 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 454 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 3928 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:33,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 3928 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:22:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-01-09 08:22:33,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 964. [2025-01-09 08:22:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 963 states have (on average 1.4818276220145379) internal successors, (1427), 963 states have internal predecessors, (1427), 0 states have call successors, (0), 0 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:22:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1427 transitions. [2025-01-09 08:22:33,838 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1427 transitions. Word has length 129 [2025-01-09 08:22:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:33,838 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1427 transitions. [2025-01-09 08:22:33,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:22:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1427 transitions. [2025-01-09 08:22:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 08:22:33,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:33,840 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] [2025-01-09 08:22:33,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:22:33,840 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:33,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1154785798, now seen corresponding path program 1 times [2025-01-09 08:22:33,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:33,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380032699] [2025-01-09 08:22:33,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:33,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:33,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 08:22:33,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 08:22:33,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:33,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:34,308 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:22:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380032699] [2025-01-09 08:22:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380032699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:34,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:34,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:22:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656365636] [2025-01-09 08:22:34,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:34,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:22:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:34,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:22:34,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:22:34,313 INFO L87 Difference]: Start difference. First operand 964 states and 1427 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:22:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:34,409 INFO L93 Difference]: Finished difference Result 1884 states and 2790 transitions. [2025-01-09 08:22:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:22:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-01-09 08:22:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:34,414 INFO L225 Difference]: With dead ends: 1884 [2025-01-09 08:22:34,414 INFO L226 Difference]: Without dead ends: 976 [2025-01-09 08:22:34,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:22:34,417 INFO L435 NwaCegarLoop]: 1011 mSDtfsCounter, 20 mSDsluCounter, 6043 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7054 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:34,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 7054 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-01-09 08:22:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2025-01-09 08:22:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.48) internal successors, (1443), 975 states have internal predecessors, (1443), 0 states have call successors, (0), 0 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:22:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1443 transitions. [2025-01-09 08:22:34,438 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1443 transitions. Word has length 130 [2025-01-09 08:22:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:34,438 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1443 transitions. [2025-01-09 08:22:34,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:22:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1443 transitions. [2025-01-09 08:22:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 08:22:34,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:34,440 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] [2025-01-09 08:22:34,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:22:34,440 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:34,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1787399430, now seen corresponding path program 1 times [2025-01-09 08:22:34,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:34,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511864396] [2025-01-09 08:22:34,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:34,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:34,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 08:22:34,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 08:22:34,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:34,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:34,753 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:22:34,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:34,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511864396] [2025-01-09 08:22:34,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511864396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:34,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:34,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:34,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976698161] [2025-01-09 08:22:34,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:34,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:34,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:34,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:34,757 INFO L87 Difference]: Start difference. First operand 976 states and 1443 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:22:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:34,812 INFO L93 Difference]: Finished difference Result 1932 states and 2858 transitions. [2025-01-09 08:22:34,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:34,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-01-09 08:22:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:34,816 INFO L225 Difference]: With dead ends: 1932 [2025-01-09 08:22:34,816 INFO L226 Difference]: Without dead ends: 1012 [2025-01-09 08:22:34,817 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:22:34,818 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 16 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4044 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:22:34,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4044 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-01-09 08:22:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2025-01-09 08:22:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.4787339268051434) internal successors, (1495), 1011 states have internal predecessors, (1495), 0 states have call successors, (0), 0 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:22:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1495 transitions. [2025-01-09 08:22:34,839 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1495 transitions. Word has length 131 [2025-01-09 08:22:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:34,839 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1495 transitions. [2025-01-09 08:22:34,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:22:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1495 transitions. [2025-01-09 08:22:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 08:22:34,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:34,841 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] [2025-01-09 08:22:34,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 08:22:34,842 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:34,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1765886679, now seen corresponding path program 1 times [2025-01-09 08:22:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098589987] [2025-01-09 08:22:34,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:34,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 08:22:34,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 08:22:34,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:34,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:35,273 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:22:35,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:35,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098589987] [2025-01-09 08:22:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098589987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:35,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411677390] [2025-01-09 08:22:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:35,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:35,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:35,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:35,277 INFO L87 Difference]: Start difference. First operand 1012 states and 1495 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:22:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:35,363 INFO L93 Difference]: Finished difference Result 1980 states and 2926 transitions. [2025-01-09 08:22:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:35,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-01-09 08:22:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:35,372 INFO L225 Difference]: With dead ends: 1980 [2025-01-09 08:22:35,372 INFO L226 Difference]: Without dead ends: 1024 [2025-01-09 08:22:35,378 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:22:35,378 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 4 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4044 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:22:35,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4044 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2025-01-09 08:22:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2025-01-09 08:22:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.47702834799609) internal successors, (1511), 1023 states have internal predecessors, (1511), 0 states have call successors, (0), 0 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:22:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1511 transitions. [2025-01-09 08:22:35,417 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1511 transitions. Word has length 132 [2025-01-09 08:22:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:35,417 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1511 transitions. [2025-01-09 08:22:35,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:22:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1511 transitions. [2025-01-09 08:22:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 08:22:35,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:35,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:35,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:22:35,419 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:35,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash 718755276, now seen corresponding path program 1 times [2025-01-09 08:22:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:35,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029782351] [2025-01-09 08:22:35,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:35,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 08:22:35,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 08:22:35,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:35,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:35,708 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:22:35,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:35,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029782351] [2025-01-09 08:22:35,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029782351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:35,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:35,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:35,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385548512] [2025-01-09 08:22:35,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:35,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:35,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:35,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:35,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:35,711 INFO L87 Difference]: Start difference. First operand 1024 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:35,762 INFO L93 Difference]: Finished difference Result 2028 states and 2994 transitions. [2025-01-09 08:22:35,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:35,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-01-09 08:22:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:35,767 INFO L225 Difference]: With dead ends: 2028 [2025-01-09 08:22:35,767 INFO L226 Difference]: Without dead ends: 1060 [2025-01-09 08:22:35,768 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:22:35,769 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 16 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4044 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:22:35,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4044 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-01-09 08:22:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2025-01-09 08:22:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1059 states have (on average 1.4759206798866855) internal successors, (1563), 1059 states have internal predecessors, (1563), 0 states have call successors, (0), 0 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:22:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1563 transitions. [2025-01-09 08:22:35,792 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1563 transitions. Word has length 133 [2025-01-09 08:22:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:35,793 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1563 transitions. [2025-01-09 08:22:35,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1563 transitions. [2025-01-09 08:22:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 08:22:35,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:35,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:35,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 08:22:35,795 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:35,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1564678188, now seen corresponding path program 1 times [2025-01-09 08:22:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:35,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725319076] [2025-01-09 08:22:35,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:35,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 08:22:35,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 08:22:35,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:35,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:39,098 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:22:39,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:39,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725319076] [2025-01-09 08:22:39,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725319076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:39,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:39,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2025-01-09 08:22:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183094617] [2025-01-09 08:22:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:39,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 08:22:39,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:39,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 08:22:39,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 08:22:39,103 INFO L87 Difference]: Start difference. First operand 1060 states and 1563 transitions. Second operand has 38 states, 38 states have (on average 3.526315789473684) internal successors, (134), 38 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:42,268 INFO L93 Difference]: Finished difference Result 2190 states and 3232 transitions. [2025-01-09 08:22:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 08:22:42,268 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.526315789473684) internal successors, (134), 38 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2025-01-09 08:22:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:42,274 INFO L225 Difference]: With dead ends: 2190 [2025-01-09 08:22:42,274 INFO L226 Difference]: Without dead ends: 1186 [2025-01-09 08:22:42,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=259, Invalid=4297, Unknown=0, NotChecked=0, Total=4556 [2025-01-09 08:22:42,278 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 1445 mSDsluCounter, 31756 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 32691 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:42,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 32691 Invalid, 2903 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 08:22:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2025-01-09 08:22:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1183. [2025-01-09 08:22:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.4780033840947546) internal successors, (1747), 1182 states have internal predecessors, (1747), 0 states have call successors, (0), 0 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:22:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1747 transitions. [2025-01-09 08:22:42,302 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1747 transitions. Word has length 134 [2025-01-09 08:22:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:42,303 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1747 transitions. [2025-01-09 08:22:42,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.526315789473684) internal successors, (134), 38 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1747 transitions. [2025-01-09 08:22:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 08:22:42,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:42,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:42,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 08:22:42,306 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:42,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash -104439963, now seen corresponding path program 1 times [2025-01-09 08:22:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:42,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245560002] [2025-01-09 08:22:42,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:42,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 08:22:42,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 08:22:42,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:42,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:45,332 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:22:45,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:45,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245560002] [2025-01-09 08:22:45,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245560002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:45,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:45,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2025-01-09 08:22:45,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637626130] [2025-01-09 08:22:45,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:45,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 08:22:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:45,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 08:22:45,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 08:22:45,337 INFO L87 Difference]: Start difference. First operand 1183 states and 1747 transitions. Second operand has 38 states, 38 states have (on average 3.5526315789473686) internal successors, (135), 38 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:47,844 INFO L93 Difference]: Finished difference Result 2563 states and 3790 transitions. [2025-01-09 08:22:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 08:22:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.5526315789473686) internal successors, (135), 38 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-01-09 08:22:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:47,849 INFO L225 Difference]: With dead ends: 2563 [2025-01-09 08:22:47,849 INFO L226 Difference]: Without dead ends: 1436 [2025-01-09 08:22:47,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=262, Invalid=4430, Unknown=0, NotChecked=0, Total=4692 [2025-01-09 08:22:47,852 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 1452 mSDsluCounter, 32684 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 33618 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:47,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 33618 Invalid, 3022 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 08:22:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-01-09 08:22:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1187. [2025-01-09 08:22:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.4780775716694772) internal successors, (1753), 1186 states have internal predecessors, (1753), 0 states have call successors, (0), 0 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:22:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1753 transitions. [2025-01-09 08:22:47,873 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1753 transitions. Word has length 135 [2025-01-09 08:22:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:47,874 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1753 transitions. [2025-01-09 08:22:47,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.5526315789473686) internal successors, (135), 38 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1753 transitions. [2025-01-09 08:22:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 08:22:47,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:47,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:47,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 08:22:47,876 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:47,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1470037869, now seen corresponding path program 1 times [2025-01-09 08:22:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:47,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805486171] [2025-01-09 08:22:47,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:47,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 08:22:48,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 08:22:48,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:48,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:48,878 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:22:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:48,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805486171] [2025-01-09 08:22:48,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805486171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:48,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:48,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:22:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704784962] [2025-01-09 08:22:48,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:48,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:22:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:48,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:22:48,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:48,879 INFO L87 Difference]: Start difference. First operand 1187 states and 1753 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:48,988 INFO L93 Difference]: Finished difference Result 2324 states and 3432 transitions. [2025-01-09 08:22:48,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:22:48,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-01-09 08:22:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:48,993 INFO L225 Difference]: With dead ends: 2324 [2025-01-09 08:22:48,993 INFO L226 Difference]: Without dead ends: 1193 [2025-01-09 08:22:48,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:22:48,995 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 990 mSDsluCounter, 4010 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:48,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 5019 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-01-09 08:22:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1191. [2025-01-09 08:22:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1190 states have (on average 1.4747899159663866) internal successors, (1755), 1190 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1755 transitions. [2025-01-09 08:22:49,018 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1755 transitions. Word has length 135 [2025-01-09 08:22:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:49,018 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1755 transitions. [2025-01-09 08:22:49,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1755 transitions. [2025-01-09 08:22:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 08:22:49,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:49,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:49,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 08:22:49,024 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:49,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash -159581980, now seen corresponding path program 1 times [2025-01-09 08:22:49,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:49,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266807722] [2025-01-09 08:22:49,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:49,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:49,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 08:22:49,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 08:22:49,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:49,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:22:49,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:22:49,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 08:22:49,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 08:22:49,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:49,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:22:49,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:22:49,686 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:22:49,687 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:22:49,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 08:22:49,691 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] [2025-01-09 08:22:49,815 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:22:49,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:22:49 BoogieIcfgContainer [2025-01-09 08:22:49,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:22:49,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:22:49,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:22:49,820 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:22:49,821 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:22:20" (3/4) ... [2025-01-09 08:22:49,822 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:22:49,823 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:22:49,824 INFO L158 Benchmark]: Toolchain (without parser) took 34015.29ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 111.0MB in the beginning and 242.4MB in the end (delta: -131.4MB). Peak memory consumption was 313.5MB. Max. memory is 16.1GB. [2025-01-09 08:22:49,824 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:22:49,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 659.70ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 61.2MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 08:22:49,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 310.03ms. Allocated memory is still 142.6MB. Free memory was 61.2MB in the beginning and 58.8MB in the end (delta: 2.4MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2025-01-09 08:22:49,826 INFO L158 Benchmark]: Boogie Preprocessor took 454.07ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 66.6MB in the end (delta: -7.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 08:22:49,826 INFO L158 Benchmark]: RCFGBuilder took 3380.10ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 66.6MB in the beginning and 191.3MB in the end (delta: -124.7MB). Peak memory consumption was 163.6MB. Max. memory is 16.1GB. [2025-01-09 08:22:49,826 INFO L158 Benchmark]: TraceAbstraction took 29200.34ms. Allocated memory was 285.2MB in the beginning and 587.2MB in the end (delta: 302.0MB). Free memory was 188.4MB in the beginning and 242.4MB in the end (delta: -54.0MB). Peak memory consumption was 249.6MB. Max. memory is 16.1GB. [2025-01-09 08:22:49,826 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 587.2MB. Free memory was 242.4MB in the beginning and 242.4MB in the end (delta: 52.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:22:49,828 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 659.70ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 61.2MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 310.03ms. Allocated memory is still 142.6MB. Free memory was 61.2MB in the beginning and 58.8MB in the end (delta: 2.4MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 454.07ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 66.6MB in the end (delta: -7.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * RCFGBuilder took 3380.10ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 66.6MB in the beginning and 191.3MB in the end (delta: -124.7MB). Peak memory consumption was 163.6MB. Max. memory is 16.1GB. * TraceAbstraction took 29200.34ms. Allocated memory was 285.2MB in the beginning and 587.2MB in the end (delta: 302.0MB). Free memory was 188.4MB in the beginning and 242.4MB in the end (delta: -54.0MB). Peak memory consumption was 249.6MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 587.2MB. Free memory was 242.4MB in the beginning and 242.4MB in the end (delta: 52.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 353, overapproximation of bitwiseAnd at line 358. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_24 mask_SORT_24 = (SORT_24)-1 >> (sizeof(SORT_24) * 8 - 2); [L39] const SORT_24 msb_SORT_24 = (SORT_24)1 << (2 - 1); [L41] const SORT_156 mask_SORT_156 = (SORT_156)-1 >> (sizeof(SORT_156) * 8 - 4); [L42] const SORT_156 msb_SORT_156 = (SORT_156)1 << (4 - 1); [L44] const SORT_204 mask_SORT_204 = (SORT_204)-1 >> (sizeof(SORT_204) * 8 - 32); [L45] const SORT_204 msb_SORT_204 = (SORT_204)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_10 var_12 = 3; [L49] const SORT_10 var_15 = 4; [L50] const SORT_10 var_18 = 0; [L51] const SORT_1 var_22 = 1; [L52] const SORT_24 var_26 = 0; [L53] const SORT_24 var_29 = 3; [L54] const SORT_3 var_34 = 0; [L55] const SORT_1 var_45 = 0; [L56] const SORT_10 var_118 = 2; [L57] const SORT_10 var_122 = 1; [L58] const SORT_10 var_128 = 5; [L59] const SORT_10 var_172 = 7; [L60] const SORT_10 var_177 = 6; [L61] const SORT_204 var_206 = 0; [L62] const SORT_3 var_221 = 2; [L63] const SORT_3 var_243 = 31; [L65] SORT_1 input_2; [L66] SORT_3 input_4; [L67] SORT_5 input_6; [L68] SORT_3 input_232; [L69] SORT_3 input_233; [L70] SORT_3 input_234; [L71] SORT_3 input_242; [L72] SORT_3 input_252; [L73] SORT_3 input_253; [L74] SORT_3 input_254; [L75] SORT_3 input_257; [L76] SORT_3 input_276; [L77] SORT_3 input_277; [L78] SORT_3 input_278; [L79] SORT_3 input_281; [L80] SORT_3 input_283; [L81] SORT_24 input_297; [L82] SORT_24 input_298; [L83] SORT_24 input_299; [L85] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L85] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L86] SORT_10 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L87] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L88] SORT_3 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L89] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L90] SORT_1 state_102 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L91] SORT_3 state_104 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L92] SORT_3 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L93] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L94] SORT_3 state_110 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L95] SORT_3 state_112 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L96] SORT_3 state_114 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L97] SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L99] SORT_5 init_9_arg_1 = var_7; [L100] state_8 = init_9_arg_1 [L101] SORT_10 init_20_arg_1 = var_18; [L102] state_19 = init_20_arg_1 [L103] SORT_3 init_36_arg_1 = var_34; [L104] state_35 = init_36_arg_1 [L105] SORT_3 init_39_arg_1 = var_34; [L106] state_38 = init_39_arg_1 [L107] SORT_3 init_43_arg_1 = var_34; [L108] state_42 = init_43_arg_1 [L109] SORT_1 init_103_arg_1 = var_45; [L110] state_102 = init_103_arg_1 [L111] SORT_3 init_105_arg_1 = var_34; [L112] state_104 = init_105_arg_1 [L113] SORT_3 init_107_arg_1 = var_34; [L114] state_106 = init_107_arg_1 [L115] SORT_3 init_109_arg_1 = var_34; [L116] state_108 = init_109_arg_1 [L117] SORT_3 init_111_arg_1 = var_34; [L118] state_110 = init_111_arg_1 [L119] SORT_3 init_113_arg_1 = var_34; [L120] state_112 = init_113_arg_1 [L121] SORT_3 init_115_arg_1 = var_34; [L122] state_114 = init_115_arg_1 [L123] SORT_3 init_117_arg_1 = var_34; [L124] state_116 = init_117_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L127] input_2 = __VERIFIER_nondet_uchar() [L128] input_4 = __VERIFIER_nondet_uchar() [L129] input_6 = __VERIFIER_nondet_ushort() [L130] input_232 = __VERIFIER_nondet_uchar() [L131] input_233 = __VERIFIER_nondet_uchar() [L132] input_234 = __VERIFIER_nondet_uchar() [L133] input_242 = __VERIFIER_nondet_uchar() [L134] input_252 = __VERIFIER_nondet_uchar() [L135] input_253 = __VERIFIER_nondet_uchar() [L136] input_254 = __VERIFIER_nondet_uchar() [L137] input_257 = __VERIFIER_nondet_uchar() [L138] input_276 = __VERIFIER_nondet_uchar() [L139] input_277 = __VERIFIER_nondet_uchar() [L140] input_278 = __VERIFIER_nondet_uchar() [L141] input_281 = __VERIFIER_nondet_uchar() [L142] input_283 = __VERIFIER_nondet_uchar() [L143] input_297 = __VERIFIER_nondet_uchar() [L144] input_298 = __VERIFIER_nondet_uchar() [L145] input_299 = __VERIFIER_nondet_uchar() [L148] SORT_5 var_11_arg_0 = state_8; [L149] SORT_10 var_11 = var_11_arg_0 >> 9; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L150] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L150] var_11 = var_11 & mask_SORT_10 [L151] SORT_10 var_13_arg_0 = var_11; [L152] SORT_10 var_13_arg_1 = var_12; [L153] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L154] SORT_5 var_14_arg_0 = state_8; [L155] SORT_10 var_14 = var_14_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L156] EXPR var_14 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L156] var_14 = var_14 & mask_SORT_10 [L157] SORT_10 var_16_arg_0 = var_14; [L158] SORT_10 var_16_arg_1 = var_15; [L159] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L160] SORT_1 var_17_arg_0 = var_13; [L161] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17_arg_0=0, var_17_arg_1=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L162] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L162] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L163] SORT_10 var_21_arg_0 = state_19; [L164] SORT_1 var_21 = var_21_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_21=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L165] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L165] var_21 = var_21 & mask_SORT_1 [L166] SORT_1 var_23_arg_0 = var_21; [L167] SORT_1 var_23_arg_1 = var_22; [L168] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L169] SORT_10 var_25_arg_0 = state_19; [L170] SORT_24 var_25 = var_25_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_23=0, var_243=31, var_25=0, var_26=0, var_29=3, var_34=0, var_45=0] [L171] EXPR var_25 & mask_SORT_24 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_23=0, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L171] var_25 = var_25 & mask_SORT_24 [L172] SORT_24 var_27_arg_0 = var_25; [L173] SORT_24 var_27_arg_1 = var_26; [L174] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L175] SORT_1 var_28_arg_0 = var_23; [L176] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_25=0, var_26=0, var_28_arg_0=0, var_28_arg_1=1, var_29=3, var_34=0, var_45=0] [L177] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_25=0, var_26=0, var_29=3, var_34=0, var_45=0] [L177] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L178] SORT_24 var_30_arg_0 = var_25; [L179] SORT_24 var_30_arg_1 = var_29; [L180] SORT_1 var_30 = var_30_arg_0 == var_30_arg_1; [L181] SORT_1 var_31_arg_0 = var_28; [L182] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_31_arg_0=1, var_31_arg_1=0, var_34=0, var_45=0] [L183] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L183] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L184] SORT_1 var_32_arg_0 = var_17; [L185] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_32_arg_0=0, var_32_arg_1=1, var_34=0, var_45=0] [L186] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L186] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L187] SORT_1 var_33_arg_0 = var_32; [L188] SORT_1 var_33 = ~var_33_arg_0; [L189] SORT_3 var_37_arg_0 = state_35; [L190] SORT_1 var_37 = var_37_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_45=0] [L191] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L191] var_37 = var_37 & mask_SORT_1 [L192] SORT_3 var_40_arg_0 = state_38; [L193] SORT_1 var_40 = var_40_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_45=0] [L194] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_45=0] [L194] var_40 = var_40 & mask_SORT_1 [L195] SORT_1 var_41_arg_0 = var_37; [L196] SORT_1 var_41_arg_1 = var_40; [L197] SORT_1 var_41 = var_41_arg_0 != var_41_arg_1; [L198] SORT_3 var_44_arg_0 = state_42; [L199] SORT_1 var_44 = var_44_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_41=0, var_44=0, var_45=0] [L200] EXPR var_44 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_41=0, var_45=0] [L200] var_44 = var_44 & mask_SORT_1 [L201] SORT_1 var_46_arg_0 = var_44; [L202] SORT_1 var_46_arg_1 = var_45; [L203] SORT_1 var_46 = var_46_arg_0 == var_46_arg_1; [L204] SORT_1 var_47_arg_0 = var_41; [L205] SORT_1 var_47_arg_1 = var_46; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_44=0, var_45=0, var_47_arg_0=0, var_47_arg_1=1] [L206] EXPR var_47_arg_0 | var_47_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_44=0, var_45=0] [L206] SORT_1 var_47 = var_47_arg_0 | var_47_arg_1; [L207] SORT_1 var_48_arg_0 = var_44; [L208] SORT_1 var_48_arg_1 = var_45; [L209] SORT_1 var_48 = var_48_arg_0 != var_48_arg_1; [L210] SORT_1 var_49_arg_0 = var_37; [L211] SORT_1 var_49_arg_1 = var_40; [L212] SORT_1 var_49 = var_49_arg_0 == var_49_arg_1; [L213] SORT_1 var_50_arg_0 = var_48; [L214] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_47=1, var_50_arg_0=0, var_50_arg_1=1] [L215] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_47=1] [L215] SORT_1 var_50 = var_50_arg_0 | var_50_arg_1; [L216] SORT_1 var_51_arg_0 = var_47; [L217] SORT_1 var_51_arg_1 = var_50; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51_arg_0=1, var_51_arg_1=1] [L218] EXPR var_51_arg_0 & var_51_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L218] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L219] SORT_3 var_52_arg_0 = state_35; [L220] SORT_1 var_52 = var_52_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0] [L221] EXPR var_52 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1] [L221] var_52 = var_52 & mask_SORT_1 [L222] SORT_3 var_53_arg_0 = state_38; [L223] SORT_1 var_53 = var_53_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0] [L224] EXPR var_53 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0] [L224] var_53 = var_53 & mask_SORT_1 [L225] SORT_1 var_54_arg_0 = var_52; [L226] SORT_1 var_54_arg_1 = var_53; [L227] SORT_1 var_54 = var_54_arg_0 != var_54_arg_1; [L228] SORT_3 var_55_arg_0 = state_42; [L229] SORT_1 var_55 = var_55_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_54=0, var_55=0] [L230] EXPR var_55 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_54=0] [L230] var_55 = var_55 & mask_SORT_1 [L231] SORT_1 var_56_arg_0 = var_55; [L232] SORT_1 var_56_arg_1 = var_45; [L233] SORT_1 var_56 = var_56_arg_0 == var_56_arg_1; [L234] SORT_1 var_57_arg_0 = var_54; [L235] SORT_1 var_57_arg_1 = var_56; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_55=0, var_57_arg_0=0, var_57_arg_1=1] [L236] EXPR var_57_arg_0 | var_57_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_55=0] [L236] SORT_1 var_57 = var_57_arg_0 | var_57_arg_1; [L237] SORT_1 var_58_arg_0 = var_51; [L238] SORT_1 var_58_arg_1 = var_57; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_52=0, var_53=0, var_55=0, var_58_arg_0=1, var_58_arg_1=1] [L239] EXPR var_58_arg_0 & var_58_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_52=0, var_53=0, var_55=0] [L239] SORT_1 var_58 = var_58_arg_0 & var_58_arg_1; [L240] SORT_1 var_59_arg_0 = var_55; [L241] SORT_1 var_59_arg_1 = var_45; [L242] SORT_1 var_59 = var_59_arg_0 != var_59_arg_1; [L243] SORT_1 var_60_arg_0 = var_52; [L244] SORT_1 var_60_arg_1 = var_53; [L245] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L246] SORT_1 var_61_arg_0 = var_59; [L247] SORT_1 var_61_arg_1 = var_60; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_58=1, var_61_arg_0=0, var_61_arg_1=1] [L248] EXPR var_61_arg_0 | var_61_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_58=1] [L248] SORT_1 var_61 = var_61_arg_0 | var_61_arg_1; [L249] SORT_1 var_62_arg_0 = var_58; [L250] SORT_1 var_62_arg_1 = var_61; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62_arg_0=1, var_62_arg_1=1] [L251] EXPR var_62_arg_0 & var_62_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L251] SORT_1 var_62 = var_62_arg_0 & var_62_arg_1; [L252] SORT_3 var_63_arg_0 = state_35; [L253] SORT_1 var_63 = var_63_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0] [L254] EXPR var_63 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1] [L254] var_63 = var_63 & mask_SORT_1 [L255] SORT_3 var_64_arg_0 = state_38; [L256] SORT_1 var_64 = var_64_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0] [L257] EXPR var_64 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0] [L257] var_64 = var_64 & mask_SORT_1 [L258] SORT_1 var_65_arg_0 = var_63; [L259] SORT_1 var_65_arg_1 = var_64; [L260] SORT_1 var_65 = var_65_arg_0 != var_65_arg_1; [L261] SORT_3 var_66_arg_0 = state_42; [L262] SORT_1 var_66 = var_66_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_65=0, var_66=0] [L263] EXPR var_66 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_65=0] [L263] var_66 = var_66 & mask_SORT_1 [L264] SORT_1 var_67_arg_0 = var_66; [L265] SORT_1 var_67_arg_1 = var_45; [L266] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L267] SORT_1 var_68_arg_0 = var_65; [L268] SORT_1 var_68_arg_1 = var_67; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_66=0, var_68_arg_0=0, var_68_arg_1=1] [L269] EXPR var_68_arg_0 | var_68_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_66=0] [L269] SORT_1 var_68 = var_68_arg_0 | var_68_arg_1; [L270] SORT_1 var_69_arg_0 = var_62; [L271] SORT_1 var_69_arg_1 = var_68; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_63=0, var_64=0, var_66=0, var_69_arg_0=1, var_69_arg_1=1] [L272] EXPR var_69_arg_0 & var_69_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_63=0, var_64=0, var_66=0] [L272] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L273] SORT_1 var_70_arg_0 = var_66; [L274] SORT_1 var_70_arg_1 = var_45; [L275] SORT_1 var_70 = var_70_arg_0 != var_70_arg_1; [L276] SORT_1 var_71_arg_0 = var_63; [L277] SORT_1 var_71_arg_1 = var_64; [L278] SORT_1 var_71 = var_71_arg_0 == var_71_arg_1; [L279] SORT_1 var_72_arg_0 = var_70; [L280] SORT_1 var_72_arg_1 = var_71; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_69=1, var_72_arg_0=0, var_72_arg_1=1] [L281] EXPR var_72_arg_0 | var_72_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_69=1] [L281] SORT_1 var_72 = var_72_arg_0 | var_72_arg_1; [L282] SORT_1 var_73_arg_0 = var_69; [L283] SORT_1 var_73_arg_1 = var_72; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73_arg_0=1, var_73_arg_1=1] [L284] EXPR var_73_arg_0 & var_73_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L284] SORT_1 var_73 = var_73_arg_0 & var_73_arg_1; [L285] SORT_3 var_74_arg_0 = state_35; [L286] SORT_1 var_74 = var_74_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0] [L287] EXPR var_74 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1] [L287] var_74 = var_74 & mask_SORT_1 [L288] SORT_3 var_75_arg_0 = state_38; [L289] SORT_1 var_75 = var_75_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0] [L290] EXPR var_75 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0] [L290] var_75 = var_75 & mask_SORT_1 [L291] SORT_1 var_76_arg_0 = var_74; [L292] SORT_1 var_76_arg_1 = var_75; [L293] SORT_1 var_76 = var_76_arg_0 != var_76_arg_1; [L294] SORT_3 var_77_arg_0 = state_42; [L295] SORT_1 var_77 = var_77_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_76=0, var_77=0] [L296] EXPR var_77 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_76=0] [L296] var_77 = var_77 & mask_SORT_1 [L297] SORT_1 var_78_arg_0 = var_77; [L298] SORT_1 var_78_arg_1 = var_45; [L299] SORT_1 var_78 = var_78_arg_0 == var_78_arg_1; [L300] SORT_1 var_79_arg_0 = var_76; [L301] SORT_1 var_79_arg_1 = var_78; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_77=0, var_79_arg_0=0, var_79_arg_1=1] [L302] EXPR var_79_arg_0 | var_79_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_77=0] [L302] SORT_1 var_79 = var_79_arg_0 | var_79_arg_1; [L303] SORT_1 var_80_arg_0 = var_73; [L304] SORT_1 var_80_arg_1 = var_79; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_74=0, var_75=0, var_77=0, var_80_arg_0=1, var_80_arg_1=1] [L305] EXPR var_80_arg_0 & var_80_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_74=0, var_75=0, var_77=0] [L305] SORT_1 var_80 = var_80_arg_0 & var_80_arg_1; [L306] SORT_1 var_81_arg_0 = var_77; [L307] SORT_1 var_81_arg_1 = var_45; [L308] SORT_1 var_81 = var_81_arg_0 != var_81_arg_1; [L309] SORT_1 var_82_arg_0 = var_74; [L310] SORT_1 var_82_arg_1 = var_75; [L311] SORT_1 var_82 = var_82_arg_0 == var_82_arg_1; [L312] SORT_1 var_83_arg_0 = var_81; [L313] SORT_1 var_83_arg_1 = var_82; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_80=1, var_83_arg_0=0, var_83_arg_1=1] [L314] EXPR var_83_arg_0 | var_83_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_80=1] [L314] SORT_1 var_83 = var_83_arg_0 | var_83_arg_1; [L315] SORT_1 var_84_arg_0 = var_80; [L316] SORT_1 var_84_arg_1 = var_83; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84_arg_0=1, var_84_arg_1=1] [L317] EXPR var_84_arg_0 & var_84_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L317] SORT_1 var_84 = var_84_arg_0 & var_84_arg_1; [L318] SORT_3 var_85_arg_0 = state_35; [L319] SORT_1 var_85 = var_85_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0] [L320] EXPR var_85 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1] [L320] var_85 = var_85 & mask_SORT_1 [L321] SORT_3 var_86_arg_0 = state_38; [L322] SORT_1 var_86 = var_86_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0] [L323] EXPR var_86 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0] [L323] var_86 = var_86 & mask_SORT_1 [L324] SORT_1 var_87_arg_0 = var_85; [L325] SORT_1 var_87_arg_1 = var_86; [L326] SORT_1 var_87 = var_87_arg_0 != var_87_arg_1; [L327] SORT_3 var_88_arg_0 = state_42; [L328] SORT_1 var_88 = var_88_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_87=0, var_88=0] [L329] EXPR var_88 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_87=0] [L329] var_88 = var_88 & mask_SORT_1 [L330] SORT_1 var_89_arg_0 = var_88; [L331] SORT_1 var_89_arg_1 = var_45; [L332] SORT_1 var_89 = var_89_arg_0 == var_89_arg_1; [L333] SORT_1 var_90_arg_0 = var_87; [L334] SORT_1 var_90_arg_1 = var_89; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_88=0, var_90_arg_0=0, var_90_arg_1=1] [L335] EXPR var_90_arg_0 | var_90_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_88=0] [L335] SORT_1 var_90 = var_90_arg_0 | var_90_arg_1; [L336] SORT_1 var_91_arg_0 = var_84; [L337] SORT_1 var_91_arg_1 = var_90; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_85=0, var_86=0, var_88=0, var_91_arg_0=1, var_91_arg_1=1] [L338] EXPR var_91_arg_0 & var_91_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_85=0, var_86=0, var_88=0] [L338] SORT_1 var_91 = var_91_arg_0 & var_91_arg_1; [L339] SORT_1 var_92_arg_0 = var_88; [L340] SORT_1 var_92_arg_1 = var_45; [L341] SORT_1 var_92 = var_92_arg_0 != var_92_arg_1; [L342] SORT_1 var_93_arg_0 = var_85; [L343] SORT_1 var_93_arg_1 = var_86; [L344] SORT_1 var_93 = var_93_arg_0 == var_93_arg_1; [L345] SORT_1 var_94_arg_0 = var_92; [L346] SORT_1 var_94_arg_1 = var_93; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_91=1, var_94_arg_0=0, var_94_arg_1=1] [L347] EXPR var_94_arg_0 | var_94_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_91=1] [L347] SORT_1 var_94 = var_94_arg_0 | var_94_arg_1; [L348] SORT_1 var_95_arg_0 = var_91; [L349] SORT_1 var_95_arg_1 = var_94; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_95_arg_0=1, var_95_arg_1=1] [L350] EXPR var_95_arg_0 & var_95_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L350] SORT_1 var_95 = var_95_arg_0 & var_95_arg_1; [L351] SORT_1 var_96_arg_0 = var_33; [L352] SORT_1 var_96_arg_1 = var_95; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_96_arg_0=-1, var_96_arg_1=1] [L353] EXPR var_96_arg_0 | var_96_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L353] SORT_1 var_96 = var_96_arg_0 | var_96_arg_1; [L354] SORT_1 var_99_arg_0 = var_96; [L355] SORT_1 var_99 = ~var_99_arg_0; [L356] SORT_1 var_100_arg_0 = var_22; [L357] SORT_1 var_100_arg_1 = var_99; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_100_arg_0=1, var_100_arg_1=-1, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L358] EXPR var_100_arg_0 & var_100_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L358] SORT_1 var_100 = var_100_arg_0 & var_100_arg_1; [L359] EXPR var_100 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L359] var_100 = var_100 & mask_SORT_1 [L360] SORT_1 bad_101_arg_0 = var_100; [L361] CALL __VERIFIER_assert(!(bad_101_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 683 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.9s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10128 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10128 mSDsluCounter, 152745 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131236 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6908 IncrementalHoareTripleChecker+Invalid, 6979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 21509 mSDtfsCounter, 6908 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1191occurred in iteration=21, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 1316 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 2825 NumberOfCodeBlocks, 2825 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2668 ConstructedInterpolants, 0 QuantifiedInterpolants, 7499 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:22:49,860 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_vsaR_p08.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 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:22:52,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:22:52,168 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:22:52,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:22:52,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:22:52,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:22:52,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:22:52,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:22:52,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:22:52,215 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:22:52,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:22:52,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:22:52,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:22:52,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:22:52,216 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:22:52,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:22:52,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:22:52,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:22:52,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:22:52,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:22:52,218 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:22:52,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:22:52,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:22:52,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:22:52,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:22:52,219 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 -> 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e [2025-01-09 08:22:52,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:22:52,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:22:52,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:22:52,544 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:22:52,544 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:22:52,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-01-09 08:22:53,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4945ac40a/0236297066e74c40bfd068a27795f096/FLAG84959b615 [2025-01-09 08:22:54,212 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:22:54,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-01-09 08:22:54,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4945ac40a/0236297066e74c40bfd068a27795f096/FLAG84959b615 [2025-01-09 08:22:54,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4945ac40a/0236297066e74c40bfd068a27795f096 [2025-01-09 08:22:54,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:22:54,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:22:54,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:22:54,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:22:54,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:22:54,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:54,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ba0661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54, skipping insertion in model container [2025-01-09 08:22:54,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:54,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:22:54,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-01-09 08:22:54,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:22:54,723 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:22:54,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-01-09 08:22:54,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:22:54,849 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:22:54,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54 WrapperNode [2025-01-09 08:22:54,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:22:54,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:22:54,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:22:54,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:22:54,860 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:22:54" (1/1) ... [2025-01-09 08:22:54,887 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:22:54" (1/1) ... [2025-01-09 08:22:54,970 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1255 [2025-01-09 08:22:54,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:22:54,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:22:54,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:22:54,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:22:54,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:54,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:54,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:55,059 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:22:55,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:55,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:55,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:55,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:55,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:55,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:55,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:55,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:22:55,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:22:55,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:22:55,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:22:55,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (1/1) ... [2025-01-09 08:22:55,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:22:55,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:22:55,174 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:22:55,178 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:22:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:22:55,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:22:55,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:22:55,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:22:55,467 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:22:55,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:22:56,881 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2025-01-09 08:22:56,881 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:22:56,889 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:22:56,889 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:22:56,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:22:56 BoogieIcfgContainer [2025-01-09 08:22:56,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:22:56,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:22:56,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:22:56,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:22:56,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:22:54" (1/3) ... [2025-01-09 08:22:56,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18253d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:22:56, skipping insertion in model container [2025-01-09 08:22:56,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:54" (2/3) ... [2025-01-09 08:22:56,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18253d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:22:56, skipping insertion in model container [2025-01-09 08:22:56,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:22:56" (3/3) ... [2025-01-09 08:22:56,899 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-01-09 08:22:56,914 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:22:56,916 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:22:56,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:22:56,975 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;@1f1ed152, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:22:56,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:22:56,979 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:22:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:22:56,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:56,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:22:56,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:56,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:22:57,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:22:57,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946511375] [2025-01-09 08:22:57,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:57,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:22:57,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:22:57,010 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:22:57,011 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:22:57,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:22:57,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:22:57,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:57,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:57,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-01-09 08:22:57,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:22:58,681 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:22:58,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:22:58,682 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:22:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946511375] [2025-01-09 08:22:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946511375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:22:58,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195785247] [2025-01-09 08:22:58,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:22:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:22:58,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:22:58,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:22:58,706 INFO L87 Difference]: Start difference. First 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 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:22:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:58,832 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 08:22:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:22:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-01-09 08:22:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:58,840 INFO L225 Difference]: With dead ends: 18 [2025-01-09 08:22:58,840 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 08:22:58,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:58,847 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:58,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 08:22:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 08:22:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:22:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 08:22:58,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 08:22:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:58,876 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 08:22:58,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 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:22:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 08:22:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 08:22:58,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:58,877 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:58,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:22:59,082 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:22:59,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:59,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:59,084 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 08:22:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:22:59,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444438368] [2025-01-09 08:22:59,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:59,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:22:59,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:22:59,091 INFO L229 MonitoredProcess]: Starting monitored process 3 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:22:59,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:22:59,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 08:22:59,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 08:22:59,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:59,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:59,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 147 conjuncts are in the unsatisfiable core [2025-01-09 08:22:59,642 INFO L279 TraceCheckSpWp]: Computing forward predicates...