./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:50:26,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:50:26,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:50:26,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:50:26,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:50:26,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:50:26,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:50:26,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:50:26,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:50:26,356 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:50:26,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:50:26,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:50:26,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:50:26,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:50:26,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:50:26,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:50:26,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:50:26,358 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e [2025-03-16 22:50:26,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:50:26,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:50:26,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:50:26,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:50:26,579 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:50:26,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-16 22:50:27,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b939e375/98cd5d72ed7b404a8b6e2cd44242c48a/FLAG4c214d2e4 [2025-03-16 22:50:28,033 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:50:28,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-16 22:50:28,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b939e375/98cd5d72ed7b404a8b6e2cd44242c48a/FLAG4c214d2e4 [2025-03-16 22:50:28,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b939e375/98cd5d72ed7b404a8b6e2cd44242c48a [2025-03-16 22:50:28,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:50:28,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:50:28,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:50:28,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:50:28,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:50:28,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:28,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fcab670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28, skipping insertion in model container [2025-03-16 22:50:28,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:28,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:50:28,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-03-16 22:50:28,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:50:28,688 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:50:28,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-03-16 22:50:28,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:50:28,797 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:50:28,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28 WrapperNode [2025-03-16 22:50:28,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:50:28,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:50:28,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:50:28,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:50:28,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:28,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,030 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2601 [2025-03-16 22:50:29,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:50:29,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:50:29,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:50:29,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:50:29,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,206 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:50:29,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,253 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:50:29,335 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:50:29,335 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:50:29,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:50:29,336 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (1/1) ... [2025-03-16 22:50:29,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:50:29,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:29,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:50:29,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:50:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:50:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:50:29,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:50:29,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:50:29,669 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:50:29,671 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:50:31,692 INFO L? ?]: Removed 1626 outVars from TransFormulas that were not future-live. [2025-03-16 22:50:31,692 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:50:31,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:50:31,783 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:50:31,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:31 BoogieIcfgContainer [2025-03-16 22:50:31,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:50:31,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:50:31,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:50:31,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:50:31,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:50:28" (1/3) ... [2025-03-16 22:50:31,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c575c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:50:31, skipping insertion in model container [2025-03-16 22:50:31,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:28" (2/3) ... [2025-03-16 22:50:31,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c575c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:50:31, skipping insertion in model container [2025-03-16 22:50:31,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:31" (3/3) ... [2025-03-16 22:50:31,810 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-16 22:50:31,821 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:50:31,823 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c that has 1 procedures, 681 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:50:31,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:50:31,898 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;@1003a01a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:50:31,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:50:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 681 states, 679 states have (on average 1.5007363770250368) internal successors, (1019), 680 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-03-16 22:50:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 22:50:31,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:31,914 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] [2025-03-16 22:50:31,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:31,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:31,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1411499908, now seen corresponding path program 1 times [2025-03-16 22:50:31,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:31,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871497554] [2025-03-16 22:50:31,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:32,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 22:50:32,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 22:50:32,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:32,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:32,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871497554] [2025-03-16 22:50:32,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871497554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:32,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:32,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:32,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450382215] [2025-03-16 22:50:32,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:32,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:50:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:32,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:50:32,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:32,967 INFO L87 Difference]: Start difference. First operand has 681 states, 679 states have (on average 1.5007363770250368) internal successors, (1019), 680 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) Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:33,328 INFO L93 Difference]: Finished difference Result 1309 states and 1961 transitions. [2025-03-16 22:50:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:50:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-16 22:50:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:33,341 INFO L225 Difference]: With dead ends: 1309 [2025-03-16 22:50:33,341 INFO L226 Difference]: Without dead ends: 681 [2025-03-16 22:50:33,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:33,347 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:33,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2533 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:33,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-16 22:50:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2025-03-16 22:50:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.4970588235294118) internal successors, (1018), 680 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1018 transitions. [2025-03-16 22:50:33,389 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1018 transitions. Word has length 120 [2025-03-16 22:50:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:33,389 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1018 transitions. [2025-03-16 22:50:33,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1018 transitions. [2025-03-16 22:50:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 22:50:33,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:33,392 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-03-16 22:50:33,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:50:33,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:33,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash 811504103, now seen corresponding path program 1 times [2025-03-16 22:50:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:33,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165973702] [2025-03-16 22:50:33,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:33,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 22:50:33,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 22:50:33,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:33,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:33,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165973702] [2025-03-16 22:50:33,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165973702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:33,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:33,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761277570] [2025-03-16 22:50:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:33,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:50:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:33,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:50:33,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:33,892 INFO L87 Difference]: Start difference. First operand 681 states and 1018 transitions. 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-03-16 22:50:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:34,184 INFO L93 Difference]: Finished difference Result 1311 states and 1960 transitions. [2025-03-16 22:50:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:50:34,184 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-03-16 22:50:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:34,187 INFO L225 Difference]: With dead ends: 1311 [2025-03-16 22:50:34,187 INFO L226 Difference]: Without dead ends: 683 [2025-03-16 22:50:34,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:34,188 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:34,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2530 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-16 22:50:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-03-16 22:50:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 1.4956011730205279) internal successors, (1020), 682 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1020 transitions. [2025-03-16 22:50:34,201 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1020 transitions. Word has length 121 [2025-03-16 22:50:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:34,201 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1020 transitions. [2025-03-16 22:50:34,202 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-03-16 22:50:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1020 transitions. [2025-03-16 22:50:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 22:50:34,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:34,206 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-03-16 22:50:34,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:50:34,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:34,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1318333407, now seen corresponding path program 1 times [2025-03-16 22:50:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:34,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590100235] [2025-03-16 22:50:34,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:34,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 22:50:34,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 22:50:34,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:34,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:34,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:34,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590100235] [2025-03-16 22:50:34,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590100235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:34,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:34,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:50:34,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724820679] [2025-03-16 22:50:34,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:34,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:34,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:34,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:34,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:34,944 INFO L87 Difference]: Start difference. First operand 683 states and 1020 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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-03-16 22:50:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:35,431 INFO L93 Difference]: Finished difference Result 1453 states and 2171 transitions. [2025-03-16 22:50:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:50:35,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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-03-16 22:50:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:35,435 INFO L225 Difference]: With dead ends: 1453 [2025-03-16 22:50:35,435 INFO L226 Difference]: Without dead ends: 823 [2025-03-16 22:50:35,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:35,438 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 137 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 4207 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:35,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 4207 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:50:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-03-16 22:50:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 820. [2025-03-16 22:50:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 819 states have (on average 1.4945054945054945) internal successors, (1224), 819 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1224 transitions. [2025-03-16 22:50:35,456 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1224 transitions. Word has length 122 [2025-03-16 22:50:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:35,457 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1224 transitions. [2025-03-16 22:50:35,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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-03-16 22:50:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1224 transitions. [2025-03-16 22:50:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 22:50:35,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:35,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:35,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:50:35,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:35,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1963306341, now seen corresponding path program 1 times [2025-03-16 22:50:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:35,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885842037] [2025-03-16 22:50:35,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:35,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:35,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 22:50:35,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 22:50:35,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:35,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:35,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:35,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885842037] [2025-03-16 22:50:35,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885842037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:35,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:35,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:35,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516335942] [2025-03-16 22:50:35,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:35,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:35,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:35,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:35,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:35,776 INFO L87 Difference]: Start difference. First operand 820 states and 1224 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 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-03-16 22:50:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:36,108 INFO L93 Difference]: Finished difference Result 1605 states and 2396 transitions. [2025-03-16 22:50:36,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:36,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 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-03-16 22:50:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:36,114 INFO L225 Difference]: With dead ends: 1605 [2025-03-16 22:50:36,114 INFO L226 Difference]: Without dead ends: 838 [2025-03-16 22:50:36,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:36,117 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 16 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:36,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-16 22:50:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-03-16 22:50:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.4934289127837514) internal successors, (1250), 837 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1250 transitions. [2025-03-16 22:50:36,137 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1250 transitions. Word has length 123 [2025-03-16 22:50:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:36,137 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1250 transitions. [2025-03-16 22:50:36,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 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-03-16 22:50:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1250 transitions. [2025-03-16 22:50:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 22:50:36,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:36,139 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-03-16 22:50:36,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:50:36,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:36,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:36,139 INFO L85 PathProgramCache]: Analyzing trace with hash -192974068, now seen corresponding path program 1 times [2025-03-16 22:50:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:36,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665475736] [2025-03-16 22:50:36,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:36,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:36,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 22:50:36,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 22:50:36,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:36,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:36,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:36,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665475736] [2025-03-16 22:50:36,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665475736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:36,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:36,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:50:36,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087103745] [2025-03-16 22:50:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:36,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:50:36,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:36,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:50:36,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:50:36,704 INFO L87 Difference]: Start difference. First operand 838 states and 1250 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 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-03-16 22:50:37,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:37,335 INFO L93 Difference]: Finished difference Result 1633 states and 2436 transitions. [2025-03-16 22:50:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:50:37,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 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-03-16 22:50:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:37,338 INFO L225 Difference]: With dead ends: 1633 [2025-03-16 22:50:37,338 INFO L226 Difference]: Without dead ends: 848 [2025-03-16 22:50:37,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:50:37,340 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 1326 mSDsluCounter, 4169 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 5005 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:37,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 5005 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:50:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-16 22:50:37,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2025-03-16 22:50:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.493491124260355) internal successors, (1262), 845 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1262 transitions. [2025-03-16 22:50:37,355 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1262 transitions. Word has length 123 [2025-03-16 22:50:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:37,355 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1262 transitions. [2025-03-16 22:50:37,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 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-03-16 22:50:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1262 transitions. [2025-03-16 22:50:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 22:50:37,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:37,356 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-03-16 22:50:37,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:50:37,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:37,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:37,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2074340544, now seen corresponding path program 1 times [2025-03-16 22:50:37,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:37,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994048615] [2025-03-16 22:50:37,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:37,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:37,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 22:50:37,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 22:50:37,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:37,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:37,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:37,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994048615] [2025-03-16 22:50:37,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994048615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:37,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:37,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:50:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649069881] [2025-03-16 22:50:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:37,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:50:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:37,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:50:37,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:37,966 INFO L87 Difference]: Start difference. First operand 846 states and 1262 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-03-16 22:50:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:38,472 INFO L93 Difference]: Finished difference Result 1639 states and 2445 transitions. [2025-03-16 22:50:38,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:50:38,472 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-03-16 22:50:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:38,475 INFO L225 Difference]: With dead ends: 1639 [2025-03-16 22:50:38,475 INFO L226 Difference]: Without dead ends: 846 [2025-03-16 22:50:38,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:38,476 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 137 mSDsluCounter, 4192 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 5033 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:38,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 5033 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:50:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-16 22:50:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 845. [2025-03-16 22:50:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.4928909952606635) internal successors, (1260), 844 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1260 transitions. [2025-03-16 22:50:38,489 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1260 transitions. Word has length 124 [2025-03-16 22:50:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:38,489 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1260 transitions. [2025-03-16 22:50:38,489 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-03-16 22:50:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1260 transitions. [2025-03-16 22:50:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 22:50:38,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:38,491 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-03-16 22:50:38,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:50:38,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:38,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1479116102, now seen corresponding path program 1 times [2025-03-16 22:50:38,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:38,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682919753] [2025-03-16 22:50:38,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:38,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:38,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 22:50:38,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 22:50:38,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:38,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:38,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:38,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682919753] [2025-03-16 22:50:38,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682919753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:38,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:38,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:38,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804320621] [2025-03-16 22:50:38,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:38,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:38,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:38,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:38,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:38,955 INFO L87 Difference]: Start difference. First operand 845 states and 1260 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 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-03-16 22:50:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:39,401 INFO L93 Difference]: Finished difference Result 1639 states and 2444 transitions. [2025-03-16 22:50:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:39,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 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-03-16 22:50:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:39,404 INFO L225 Difference]: With dead ends: 1639 [2025-03-16 22:50:39,405 INFO L226 Difference]: Without dead ends: 847 [2025-03-16 22:50:39,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:39,406 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 987 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:39,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 3327 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:50:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-16 22:50:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-03-16 22:50:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 846 states have (on average 1.491725768321513) internal successors, (1262), 846 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1262 transitions. [2025-03-16 22:50:39,423 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1262 transitions. Word has length 124 [2025-03-16 22:50:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:39,423 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1262 transitions. [2025-03-16 22:50:39,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 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-03-16 22:50:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1262 transitions. [2025-03-16 22:50:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 22:50:39,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:39,427 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-03-16 22:50:39,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:50:39,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:39,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash 747859715, now seen corresponding path program 1 times [2025-03-16 22:50:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:39,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954019842] [2025-03-16 22:50:39,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:39,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 22:50:39,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 22:50:39,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:39,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:39,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:39,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954019842] [2025-03-16 22:50:39,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954019842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:39,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:39,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:50:39,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418456135] [2025-03-16 22:50:39,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:39,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:39,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:39,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:39,681 INFO L87 Difference]: Start difference. First operand 847 states and 1262 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-03-16 22:50:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:40,052 INFO L93 Difference]: Finished difference Result 1653 states and 2463 transitions. [2025-03-16 22:50:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:40,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-03-16 22:50:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:40,055 INFO L225 Difference]: With dead ends: 1653 [2025-03-16 22:50:40,055 INFO L226 Difference]: Without dead ends: 859 [2025-03-16 22:50:40,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:40,057 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 4 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4210 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:40,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4210 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-16 22:50:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2025-03-16 22:50:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.4895104895104896) internal successors, (1278), 858 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1278 transitions. [2025-03-16 22:50:40,071 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1278 transitions. Word has length 125 [2025-03-16 22:50:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:40,071 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1278 transitions. [2025-03-16 22:50:40,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-03-16 22:50:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1278 transitions. [2025-03-16 22:50:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 22:50:40,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:40,073 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-03-16 22:50:40,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:50:40,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:40,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:40,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2142954080, now seen corresponding path program 1 times [2025-03-16 22:50:40,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:40,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330506574] [2025-03-16 22:50:40,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:40,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:40,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 22:50:40,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 22:50:40,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:40,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330506574] [2025-03-16 22:50:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330506574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:40,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:50:40,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617598605] [2025-03-16 22:50:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:50:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:40,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:50:40,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:50:40,628 INFO L87 Difference]: Start difference. First operand 859 states and 1278 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) 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-03-16 22:50:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:41,220 INFO L93 Difference]: Finished difference Result 1683 states and 2504 transitions. [2025-03-16 22:50:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:50:41,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) 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-03-16 22:50:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:41,223 INFO L225 Difference]: With dead ends: 1683 [2025-03-16 22:50:41,223 INFO L226 Difference]: Without dead ends: 877 [2025-03-16 22:50:41,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:50:41,228 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 992 mSDsluCounter, 5022 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 5863 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:41,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 5863 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:50:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-16 22:50:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 873. [2025-03-16 22:50:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.488532110091743) internal successors, (1298), 872 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1298 transitions. [2025-03-16 22:50:41,244 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1298 transitions. Word has length 125 [2025-03-16 22:50:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:41,244 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1298 transitions. [2025-03-16 22:50:41,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) 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-03-16 22:50:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1298 transitions. [2025-03-16 22:50:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 22:50:41,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:41,245 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-03-16 22:50:41,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:50:41,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:41,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash -11027609, now seen corresponding path program 1 times [2025-03-16 22:50:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:41,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489040672] [2025-03-16 22:50:41,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:41,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 22:50:41,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 22:50:41,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:41,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:41,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:41,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489040672] [2025-03-16 22:50:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489040672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:41,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798621645] [2025-03-16 22:50:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:41,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:41,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:41,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:41,447 INFO L87 Difference]: Start difference. First operand 873 states and 1298 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 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-03-16 22:50:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:41,763 INFO L93 Difference]: Finished difference Result 1729 states and 2571 transitions. [2025-03-16 22:50:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:41,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 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-03-16 22:50:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:41,766 INFO L225 Difference]: With dead ends: 1729 [2025-03-16 22:50:41,766 INFO L226 Difference]: Without dead ends: 909 [2025-03-16 22:50:41,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:41,768 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 16 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:41,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-03-16 22:50:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2025-03-16 22:50:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.486784140969163) internal successors, (1350), 908 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1350 transitions. [2025-03-16 22:50:41,782 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1350 transitions. Word has length 126 [2025-03-16 22:50:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:41,782 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1350 transitions. [2025-03-16 22:50:41,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 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-03-16 22:50:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1350 transitions. [2025-03-16 22:50:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 22:50:41,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:41,784 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-03-16 22:50:41,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:50:41,784 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:41,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1802225547, now seen corresponding path program 1 times [2025-03-16 22:50:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:41,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301965820] [2025-03-16 22:50:41,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:41,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:41,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 22:50:41,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 22:50:41,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:41,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:42,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:42,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301965820] [2025-03-16 22:50:42,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301965820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:42,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:42,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 22:50:42,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634805757] [2025-03-16 22:50:42,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:42,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 22:50:42,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:42,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 22:50:42,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:50:42,399 INFO L87 Difference]: Start difference. First operand 909 states and 1350 transitions. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 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-03-16 22:50:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:43,200 INFO L93 Difference]: Finished difference Result 1768 states and 2626 transitions. [2025-03-16 22:50:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 22:50:43,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 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-03-16 22:50:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:43,204 INFO L225 Difference]: With dead ends: 1768 [2025-03-16 22:50:43,204 INFO L226 Difference]: Without dead ends: 912 [2025-03-16 22:50:43,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-16 22:50:43,206 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 646 mSDsluCounter, 6167 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 6991 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:43,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 6991 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:50:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-16 22:50:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2025-03-16 22:50:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.4851811196487377) internal successors, (1353), 911 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1353 transitions. [2025-03-16 22:50:43,221 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1353 transitions. Word has length 126 [2025-03-16 22:50:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:43,222 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1353 transitions. [2025-03-16 22:50:43,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 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-03-16 22:50:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1353 transitions. [2025-03-16 22:50:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 22:50:43,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:43,223 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-03-16 22:50:43,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:50:43,223 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:43,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:43,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1355013060, now seen corresponding path program 1 times [2025-03-16 22:50:43,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:43,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201334816] [2025-03-16 22:50:43,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:43,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:43,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 22:50:43,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 22:50:43,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:43,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:43,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:43,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:43,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201334816] [2025-03-16 22:50:43,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201334816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:43,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:43,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:50:43,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683018325] [2025-03-16 22:50:43,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:43,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:43,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:43,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:43,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:43,445 INFO L87 Difference]: Start difference. First operand 912 states and 1353 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-03-16 22:50:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:43,770 INFO L93 Difference]: Finished difference Result 1783 states and 2645 transitions. [2025-03-16 22:50:43,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:43,770 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-03-16 22:50:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:43,773 INFO L225 Difference]: With dead ends: 1783 [2025-03-16 22:50:43,773 INFO L226 Difference]: Without dead ends: 924 [2025-03-16 22:50:43,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:43,774 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 4 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:43,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3370 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-16 22:50:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2025-03-16 22:50:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 1.4832069339111593) internal successors, (1369), 923 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1369 transitions. [2025-03-16 22:50:43,791 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1369 transitions. Word has length 127 [2025-03-16 22:50:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:43,791 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1369 transitions. [2025-03-16 22:50:43,791 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-03-16 22:50:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1369 transitions. [2025-03-16 22:50:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 22:50:43,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:43,793 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-03-16 22:50:43,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:50:43,793 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:43,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1853946166, now seen corresponding path program 1 times [2025-03-16 22:50:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926319454] [2025-03-16 22:50:43,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:43,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:43,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 22:50:43,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 22:50:43,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:43,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:44,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926319454] [2025-03-16 22:50:44,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926319454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:44,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:44,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:50:44,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381833081] [2025-03-16 22:50:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:44,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:50:44,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:44,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:50:44,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:50:44,216 INFO L87 Difference]: Start difference. First operand 924 states and 1369 transitions. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 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-03-16 22:50:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:44,981 INFO L93 Difference]: Finished difference Result 2171 states and 3210 transitions. [2025-03-16 22:50:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 22:50:44,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 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-03-16 22:50:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:44,986 INFO L225 Difference]: With dead ends: 2171 [2025-03-16 22:50:44,987 INFO L226 Difference]: Without dead ends: 1300 [2025-03-16 22:50:44,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-16 22:50:44,988 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 1999 mSDsluCounter, 5008 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1999 SdHoareTripleChecker+Valid, 5847 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:44,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1999 Valid, 5847 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:50:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-03-16 22:50:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 928. [2025-03-16 22:50:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 1.483279395900755) internal successors, (1375), 927 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1375 transitions. [2025-03-16 22:50:45,006 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1375 transitions. Word has length 127 [2025-03-16 22:50:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:45,006 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1375 transitions. [2025-03-16 22:50:45,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 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-03-16 22:50:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1375 transitions. [2025-03-16 22:50:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 22:50:45,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:45,007 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-03-16 22:50:45,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:50:45,008 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:45,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1098093591, now seen corresponding path program 1 times [2025-03-16 22:50:45,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:45,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174254612] [2025-03-16 22:50:45,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:45,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:50:45,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:50:45,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:45,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:45,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:45,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174254612] [2025-03-16 22:50:45,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174254612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:45,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:45,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:45,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53501607] [2025-03-16 22:50:45,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:45,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:45,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:45,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:45,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:45,350 INFO L87 Difference]: Start difference. First operand 928 states and 1375 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 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-03-16 22:50:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:46,000 INFO L93 Difference]: Finished difference Result 2177 states and 3220 transitions. [2025-03-16 22:50:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:50:46,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 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-03-16 22:50:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:46,005 INFO L225 Difference]: With dead ends: 2177 [2025-03-16 22:50:46,005 INFO L226 Difference]: Without dead ends: 1302 [2025-03-16 22:50:46,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:50:46,006 INFO L435 NwaCegarLoop]: 1197 mSDtfsCounter, 1468 mSDsluCounter, 3187 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 4384 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:46,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 4384 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:50:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-03-16 22:50:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 928. [2025-03-16 22:50:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 1.483279395900755) internal successors, (1375), 927 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1375 transitions. [2025-03-16 22:50:46,046 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1375 transitions. Word has length 128 [2025-03-16 22:50:46,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:46,046 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1375 transitions. [2025-03-16 22:50:46,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 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-03-16 22:50:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1375 transitions. [2025-03-16 22:50:46,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 22:50:46,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:46,047 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-03-16 22:50:46,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:50:46,047 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:46,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1857043389, now seen corresponding path program 1 times [2025-03-16 22:50:46,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:46,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992928475] [2025-03-16 22:50:46,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:46,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:46,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:50:46,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:50:46,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:46,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:46,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:46,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992928475] [2025-03-16 22:50:46,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992928475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:46,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:46,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:50:46,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535240378] [2025-03-16 22:50:46,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:46,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:46,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:46,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:46,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:46,238 INFO L87 Difference]: Start difference. First operand 928 states and 1375 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-03-16 22:50:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:46,594 INFO L93 Difference]: Finished difference Result 1839 states and 2725 transitions. [2025-03-16 22:50:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:46,594 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-03-16 22:50:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:46,597 INFO L225 Difference]: With dead ends: 1839 [2025-03-16 22:50:46,597 INFO L226 Difference]: Without dead ends: 964 [2025-03-16 22:50:46,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:46,599 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 16 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4210 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:46,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4210 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-03-16 22:50:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2025-03-16 22:50:46,613 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-03-16 22:50:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1427 transitions. [2025-03-16 22:50:46,614 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1427 transitions. Word has length 128 [2025-03-16 22:50:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:46,614 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1427 transitions. [2025-03-16 22:50:46,615 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-03-16 22:50:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1427 transitions. [2025-03-16 22:50:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 22:50:46,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:46,616 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-03-16 22:50:46,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:50:46,616 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash -839843732, now seen corresponding path program 1 times [2025-03-16 22:50:46,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:46,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506981443] [2025-03-16 22:50:46,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:46,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 22:50:46,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 22:50:46,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:46,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:46,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:46,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506981443] [2025-03-16 22:50:46,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506981443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:46,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:46,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:46,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095981794] [2025-03-16 22:50:46,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:46,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:46,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:46,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:46,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:46,962 INFO L87 Difference]: Start difference. First operand 964 states and 1427 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 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-03-16 22:50:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:47,319 INFO L93 Difference]: Finished difference Result 2211 states and 3266 transitions. [2025-03-16 22:50:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:47,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 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-03-16 22:50:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:47,323 INFO L225 Difference]: With dead ends: 2211 [2025-03-16 22:50:47,323 INFO L226 Difference]: Without dead ends: 1300 [2025-03-16 22:50:47,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:47,324 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 454 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:47,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 3266 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:47,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-03-16 22:50:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 966. [2025-03-16 22:50:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.4808290155440416) internal successors, (1429), 965 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1429 transitions. [2025-03-16 22:50:47,337 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1429 transitions. Word has length 129 [2025-03-16 22:50:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:47,338 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1429 transitions. [2025-03-16 22:50:47,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 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-03-16 22:50:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1429 transitions. [2025-03-16 22:50:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 22:50:47,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:47,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:47,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 22:50:47,339 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:47,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2135927573, now seen corresponding path program 1 times [2025-03-16 22:50:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:47,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35279066] [2025-03-16 22:50:47,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:47,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:47,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 22:50:47,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 22:50:47,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:47,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:47,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35279066] [2025-03-16 22:50:47,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35279066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:47,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236625278] [2025-03-16 22:50:47,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:47,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:47,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:47,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:47,512 INFO L87 Difference]: Start difference. First operand 966 states and 1429 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-03-16 22:50:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:47,781 INFO L93 Difference]: Finished difference Result 1889 states and 2795 transitions. [2025-03-16 22:50:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:47,781 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-03-16 22:50:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:47,783 INFO L225 Difference]: With dead ends: 1889 [2025-03-16 22:50:47,783 INFO L226 Difference]: Without dead ends: 978 [2025-03-16 22:50:47,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:47,785 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 4 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:47,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-16 22:50:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2025-03-16 22:50:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1445 transitions. [2025-03-16 22:50:47,797 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1445 transitions. Word has length 129 [2025-03-16 22:50:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:47,797 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1445 transitions. [2025-03-16 22:50:47,797 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-03-16 22:50:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1445 transitions. [2025-03-16 22:50:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 22:50:47,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:47,798 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-03-16 22:50:47,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 22:50:47,799 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:47,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1556308083, now seen corresponding path program 1 times [2025-03-16 22:50:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:47,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945898977] [2025-03-16 22:50:47,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:47,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 22:50:47,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 22:50:47,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:47,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945898977] [2025-03-16 22:50:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945898977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:48,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:48,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:50:48,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174776265] [2025-03-16 22:50:48,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:48,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:48,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:48,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:48,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:48,010 INFO L87 Difference]: Start difference. First operand 978 states and 1445 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 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-03-16 22:50:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:48,281 INFO L93 Difference]: Finished difference Result 1937 states and 2863 transitions. [2025-03-16 22:50:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:48,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 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-03-16 22:50:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:48,284 INFO L225 Difference]: With dead ends: 1937 [2025-03-16 22:50:48,284 INFO L226 Difference]: Without dead ends: 1014 [2025-03-16 22:50:48,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:48,285 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 16 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:48,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3370 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-03-16 22:50:48,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1014. [2025-03-16 22:50:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 1.4777887462981243) internal successors, (1497), 1013 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1497 transitions. [2025-03-16 22:50:48,297 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1497 transitions. Word has length 130 [2025-03-16 22:50:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:48,297 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1497 transitions. [2025-03-16 22:50:48,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 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-03-16 22:50:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1497 transitions. [2025-03-16 22:50:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 22:50:48,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:48,299 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-03-16 22:50:48,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 22:50:48,299 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:48,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1037280370, now seen corresponding path program 1 times [2025-03-16 22:50:48,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:48,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219972447] [2025-03-16 22:50:48,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:48,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 22:50:48,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 22:50:48,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:48,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:48,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:48,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219972447] [2025-03-16 22:50:48,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219972447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:48,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:48,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:48,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925520859] [2025-03-16 22:50:48,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:48,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:48,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:48,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:48,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:48,465 INFO L87 Difference]: Start difference. First operand 1014 states and 1497 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-03-16 22:50:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:48,751 INFO L93 Difference]: Finished difference Result 1985 states and 2931 transitions. [2025-03-16 22:50:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:48,751 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-03-16 22:50:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:48,753 INFO L225 Difference]: With dead ends: 1985 [2025-03-16 22:50:48,753 INFO L226 Difference]: Without dead ends: 1026 [2025-03-16 22:50:48,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:48,755 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 4 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:48,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-03-16 22:50:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2025-03-16 22:50:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 1.4760975609756097) internal successors, (1513), 1025 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1513 transitions. [2025-03-16 22:50:48,766 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1513 transitions. Word has length 131 [2025-03-16 22:50:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:48,767 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1513 transitions. [2025-03-16 22:50:48,767 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-03-16 22:50:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1513 transitions. [2025-03-16 22:50:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 22:50:48,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:48,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:48,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 22:50:48,769 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:48,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash 624546185, now seen corresponding path program 1 times [2025-03-16 22:50:48,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:48,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369701587] [2025-03-16 22:50:48,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:48,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:48,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 22:50:48,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 22:50:48,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:48,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:48,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:48,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369701587] [2025-03-16 22:50:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369701587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:48,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:48,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43122065] [2025-03-16 22:50:48,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:48,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:48,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:48,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:48,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:48,960 INFO L87 Difference]: Start difference. First operand 1026 states and 1513 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-03-16 22:50:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:49,252 INFO L93 Difference]: Finished difference Result 2033 states and 2999 transitions. [2025-03-16 22:50:49,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:49,253 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-03-16 22:50:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:49,255 INFO L225 Difference]: With dead ends: 2033 [2025-03-16 22:50:49,255 INFO L226 Difference]: Without dead ends: 1062 [2025-03-16 22:50:49,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:49,256 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 16 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:49,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-03-16 22:50:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2025-03-16 22:50:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 1.47502356267672) internal successors, (1565), 1061 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1565 transitions. [2025-03-16 22:50:49,270 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1565 transitions. Word has length 132 [2025-03-16 22:50:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:49,271 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1565 transitions. [2025-03-16 22:50:49,271 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-03-16 22:50:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1565 transitions. [2025-03-16 22:50:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 22:50:49,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:49,272 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-03-16 22:50:49,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 22:50:49,272 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:49,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash 511348135, now seen corresponding path program 1 times [2025-03-16 22:50:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:49,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883466154] [2025-03-16 22:50:49,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:49,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 22:50:49,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 22:50:49,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:49,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:49,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883466154] [2025-03-16 22:50:49,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883466154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:49,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:49,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:50:49,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936633690] [2025-03-16 22:50:49,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:49,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:50:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:49,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:50:49,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:50:49,771 INFO L87 Difference]: Start difference. First operand 1062 states and 1565 transitions. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 8 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-03-16 22:50:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:50,389 INFO L93 Difference]: Finished difference Result 2075 states and 3057 transitions. [2025-03-16 22:50:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:50:50,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 8 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-03-16 22:50:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:50,392 INFO L225 Difference]: With dead ends: 2075 [2025-03-16 22:50:50,392 INFO L226 Difference]: Without dead ends: 1068 [2025-03-16 22:50:50,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:50:50,393 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 1317 mSDsluCounter, 4997 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 5832 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:50,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 5832 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:50:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-03-16 22:50:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1066. [2025-03-16 22:50:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1065 states have (on average 1.4741784037558685) internal successors, (1570), 1065 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1570 transitions. [2025-03-16 22:50:50,404 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1570 transitions. Word has length 133 [2025-03-16 22:50:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:50,404 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1570 transitions. [2025-03-16 22:50:50,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 8 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-03-16 22:50:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1570 transitions. [2025-03-16 22:50:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 22:50:50,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:50,405 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-03-16 22:50:50,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 22:50:50,405 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:50,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1861474939, now seen corresponding path program 1 times [2025-03-16 22:50:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:50,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129851763] [2025-03-16 22:50:50,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:50,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:50:50,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:50:50,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:50,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:51,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129851763] [2025-03-16 22:50:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129851763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:51,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:51,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:50:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725260724] [2025-03-16 22:50:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:51,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:50:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:51,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:50:51,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:50:51,424 INFO L87 Difference]: Start difference. First operand 1066 states and 1570 transitions. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 8 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-03-16 22:50:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:51,955 INFO L93 Difference]: Finished difference Result 2097 states and 3087 transitions. [2025-03-16 22:50:51,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:50:51,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 8 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-03-16 22:50:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:51,958 INFO L225 Difference]: With dead ends: 2097 [2025-03-16 22:50:51,958 INFO L226 Difference]: Without dead ends: 1086 [2025-03-16 22:50:51,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:50:51,960 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 998 mSDsluCounter, 4172 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 5011 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:51,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 5011 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:50:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-03-16 22:50:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1078. [2025-03-16 22:50:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.4707520891364902) internal successors, (1584), 1077 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1584 transitions. [2025-03-16 22:50:51,975 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1584 transitions. Word has length 134 [2025-03-16 22:50:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:51,975 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1584 transitions. [2025-03-16 22:50:51,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 8 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-03-16 22:50:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1584 transitions. [2025-03-16 22:50:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 22:50:51,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:51,976 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-03-16 22:50:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 22:50:51,976 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:51,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:51,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1325828070, now seen corresponding path program 1 times [2025-03-16 22:50:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:51,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226721584] [2025-03-16 22:50:51,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:51,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:52,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:50:52,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:50:52,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:52,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:50:52,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:50:52,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:50:52,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:50:52,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:52,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:50:52,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:50:52,339 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:50:52,340 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:50:52,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 22:50:52,344 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:52,418 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:50:52,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:50:52,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:50:52 BoogieIcfgContainer [2025-03-16 22:50:52,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:50:52,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:50:52,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:50:52,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:50:52,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:31" (3/4) ... [2025-03-16 22:50:52,447 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:50:52,447 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:50:52,448 INFO L158 Benchmark]: Toolchain (without parser) took 24176.22ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 104.3MB in the beginning and 312.8MB in the end (delta: -208.4MB). Peak memory consumption was 472.3MB. Max. memory is 16.1GB. [2025-03-16 22:50:52,448 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:50:52,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.43ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 55.2MB in the end (delta: 49.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-16 22:50:52,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 231.10ms. Allocated memory is still 142.6MB. Free memory was 55.2MB in the beginning and 53.0MB in the end (delta: 2.2MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2025-03-16 22:50:52,448 INFO L158 Benchmark]: Boogie Preprocessor took 302.32ms. Allocated memory is still 142.6MB. Free memory was 53.0MB in the beginning and 48.5MB in the end (delta: 4.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2025-03-16 22:50:52,449 INFO L158 Benchmark]: IcfgBuilder took 2448.46ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 48.5MB in the beginning and 59.4MB in the end (delta: -11.0MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. [2025-03-16 22:50:52,449 INFO L158 Benchmark]: TraceAbstraction took 20655.55ms. Allocated memory was 310.4MB in the beginning and 822.1MB in the end (delta: 511.7MB). Free memory was 57.3MB in the beginning and 312.8MB in the end (delta: -255.5MB). Peak memory consumption was 260.4MB. Max. memory is 16.1GB. [2025-03-16 22:50:52,449 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 822.1MB. Free memory was 312.8MB in the beginning and 312.8MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:50:52,450 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.27ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.43ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 55.2MB in the end (delta: 49.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 231.10ms. Allocated memory is still 142.6MB. Free memory was 55.2MB in the beginning and 53.0MB in the end (delta: 2.2MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 302.32ms. Allocated memory is still 142.6MB. Free memory was 53.0MB in the beginning and 48.5MB in the end (delta: 4.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * IcfgBuilder took 2448.46ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 48.5MB in the beginning and 59.4MB in the end (delta: -11.0MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20655.55ms. Allocated memory was 310.4MB in the beginning and 822.1MB in the end (delta: 511.7MB). Free memory was 57.3MB in the beginning and 312.8MB in the end (delta: -255.5MB). Peak memory consumption was 260.4MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 822.1MB. Free memory was 312.8MB in the beginning and 312.8MB in the end (delta: 71.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, 681 locations, 1019 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10557 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10557 mSDsluCounter, 91839 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72976 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19798 IncrementalHoareTripleChecker+Invalid, 19819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 18863 mSDtfsCounter, 19798 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1078occurred in iteration=22, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 1100 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 2922 NumberOfCodeBlocks, 2922 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2765 ConstructedInterpolants, 0 QuantifiedInterpolants, 7441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 22:50:52,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:50:54,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:50:54,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:50:54,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:50:54,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:50:54,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:50:54,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:50:54,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:50:54,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:50:54,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:50:54,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:50:54,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:50:54,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:50:54,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:50:54,390 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:50:54,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:50:54,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:50:54,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:50:54,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:50:54,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:50:54,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:50:54,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:50:54,391 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:50:54,392 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:50:54,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:50:54,392 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:50:54,392 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:50:54,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:50:54,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:50:54,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:50:54,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:50:54,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:50:54,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:50:54,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:50:54,393 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:50:54,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:50:54,393 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:50:54,393 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:50:54,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:50:54,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:50:54,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:50:54,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:50:54,394 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e [2025-03-16 22:50:54,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:50:54,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:50:54,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:50:54,605 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:50:54,605 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:50:54,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-16 22:50:55,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2788834db/6f77335cb01646b7ace88999e46ca84f/FLAGf86897435 [2025-03-16 22:50:56,001 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:50:56,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-16 22:50:56,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2788834db/6f77335cb01646b7ace88999e46ca84f/FLAGf86897435 [2025-03-16 22:50:56,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2788834db/6f77335cb01646b7ace88999e46ca84f [2025-03-16 22:50:56,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:50:56,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:50:56,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:50:56,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:50:56,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:50:56,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5210cd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56, skipping insertion in model container [2025-03-16 22:50:56,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:50:56,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-03-16 22:50:56,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:50:56,641 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:50:56,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-03-16 22:50:56,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:50:56,726 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:50:56,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56 WrapperNode [2025-03-16 22:50:56,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:50:56,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:50:56,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:50:56,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:50:56,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,811 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1255 [2025-03-16 22:50:56,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:50:56,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:50:56,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:50:56,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:50:56,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,869 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:50:56,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:50:56,929 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:50:56,929 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:50:56,929 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:50:56,930 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (1/1) ... [2025-03-16 22:50:56,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:50:56,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:56,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:50:56,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:50:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:50:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:50:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:50:56,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:50:57,146 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:50:57,147 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:50:58,162 INFO L? ?]: Removed 234 outVars from TransFormulas that were not future-live. [2025-03-16 22:50:58,163 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:50:58,168 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:50:58,169 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:50:58,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:58 BoogieIcfgContainer [2025-03-16 22:50:58,169 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:50:58,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:50:58,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:50:58,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:50:58,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:50:56" (1/3) ... [2025-03-16 22:50:58,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c64f4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:50:58, skipping insertion in model container [2025-03-16 22:50:58,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:56" (2/3) ... [2025-03-16 22:50:58,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c64f4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:50:58, skipping insertion in model container [2025-03-16 22:50:58,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:58" (3/3) ... [2025-03-16 22:50:58,177 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-16 22:50:58,187 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:50:58,188 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:50:58,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:50:58,226 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;@35f9e5ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:50:58,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:50:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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-03-16 22:50:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:50:58,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:58,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:50:58,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:58,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:50:58,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:50:58,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899151973] [2025-03-16 22:50:58,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:58,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:50:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:58,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:50:58,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 22:50:58,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:50:58,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:50:58,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:58,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:58,562 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 142 conjuncts are in the unsatisfiable core [2025-03-16 22:50:58,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:50:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:59,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:50:59,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:50:59,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899151973] [2025-03-16 22:50:59,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899151973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:59,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:59,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:50:59,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795152637] [2025-03-16 22:50:59,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:59,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:50:59,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:50:59,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:50:59,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:59,489 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:59,570 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 22:50:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:50:59,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-16 22:50:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:59,575 INFO L225 Difference]: With dead ends: 16 [2025-03-16 22:50:59,576 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 22:50:59,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-16 22:50:59,582 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 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-03-16 22:50:59,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:50:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 22:50:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 22:50:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:50:59,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:50:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:59,604 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:50:59,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:50:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:50:59,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:59,605 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:50:59,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:50:59,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:50:59,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:59,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:50:59,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:50:59,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929421203] [2025-03-16 22:50:59,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:59,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:50:59,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:59,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:50:59,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 22:51:00,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:51:00,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:51:00,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:00,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:00,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 145 conjuncts are in the unsatisfiable core [2025-03-16 22:51:00,264 INFO L279 TraceCheckSpWp]: Computing forward predicates...