./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:44:50,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:44:50,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 23:44:50,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:44:50,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:44:50,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:44:50,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:44:50,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:44:50,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:44:50,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:44:50,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:44:50,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:44:50,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:44:50,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:44:50,325 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:44:50,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:44:50,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:44:50,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:44:50,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:44:50,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:44:50,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:44:50,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:44:50,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:44:50,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:44:50,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:44:50,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:44:50,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:44:50,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:44:50,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:44:50,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:44:50,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:44:50,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:44:50,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:44:50,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:44:50,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:44:50,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:44:50,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:44:50,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:44:50,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:44:50,333 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-12 23:44:50,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:44:50,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:44:50,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:44:50,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:44:50,633 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:44:50,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2024-10-12 23:44:52,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:44:52,313 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:44:52,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2024-10-12 23:44:52,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10c291a96/0eab1d0ca8fc4a8f8fedb2e82240d81a/FLAG2340bd730 [2024-10-12 23:44:52,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10c291a96/0eab1d0ca8fc4a8f8fedb2e82240d81a [2024-10-12 23:44:52,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:44:52,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:44:52,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:44:52,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:44:52,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:44:52,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:44:52" (1/1) ... [2024-10-12 23:44:52,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dfa09ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:52, skipping insertion in model container [2024-10-12 23:44:52,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:44:52" (1/1) ... [2024-10-12 23:44:52,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:44:52,907 WARN L248 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] [2024-10-12 23:44:53,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:44:53,256 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:44:53,268 WARN L248 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] [2024-10-12 23:44:53,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:44:53,384 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:44:53,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53 WrapperNode [2024-10-12 23:44:53,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:44:53,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:44:53,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:44:53,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:44:53,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:53,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:53,851 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2602 [2024-10-12 23:44:53,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:44:53,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:44:53,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:44:53,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:44:53,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:53,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:54,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:54,135 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]. [2024-10-12 23:44:54,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:54,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:54,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:54,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:54,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:54,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:54,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:44:54,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:44:54,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:44:54,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:44:54,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (1/1) ... [2024-10-12 23:44:54,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:44:54,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:44:54,367 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) [2024-10-12 23:44:54,370 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 [2024-10-12 23:44:54,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:44:54,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:44:54,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:44:54,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:44:54,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:44:54,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:44:57,023 INFO L? ?]: Removed 1628 outVars from TransFormulas that were not future-live. [2024-10-12 23:44:57,023 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:44:57,108 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:44:57,112 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:44:57,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:44:57 BoogieIcfgContainer [2024-10-12 23:44:57,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:44:57,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:44:57,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:44:57,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:44:57,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:44:52" (1/3) ... [2024-10-12 23:44:57,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7950069e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:44:57, skipping insertion in model container [2024-10-12 23:44:57,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:44:53" (2/3) ... [2024-10-12 23:44:57,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7950069e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:44:57, skipping insertion in model container [2024-10-12 23:44:57,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:44:57" (3/3) ... [2024-10-12 23:44:57,125 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c [2024-10-12 23:44:57,143 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:44:57,143 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:44:57,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:44:57,233 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;@3efeb0b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:44:57,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:44:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 680 states, 678 states have (on average 1.5014749262536873) internal successors, (1018), 679 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) [2024-10-12 23:44:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 23:44:57,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:44:57,260 INFO L215 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] [2024-10-12 23:44:57,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:44:57,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:44:57,266 INFO L85 PathProgramCache]: Analyzing trace with hash 311776621, now seen corresponding path program 1 times [2024-10-12 23:44:57,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:44:57,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37404626] [2024-10-12 23:44:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:44:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:44:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:44:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:44:58,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:44:58,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37404626] [2024-10-12 23:44:58,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37404626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:44:58,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:44:58,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:44:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277539607] [2024-10-12 23:44:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:44:58,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:44:58,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:44:58,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:44:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:44:58,636 INFO L87 Difference]: Start difference. First operand has 680 states, 678 states have (on average 1.5014749262536873) internal successors, (1018), 679 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) 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) [2024-10-12 23:44:58,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:44:58,744 INFO L93 Difference]: Finished difference Result 1308 states and 1960 transitions. [2024-10-12 23:44:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:44:58,747 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 [2024-10-12 23:44:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:44:58,766 INFO L225 Difference]: With dead ends: 1308 [2024-10-12 23:44:58,766 INFO L226 Difference]: Without dead ends: 681 [2024-10-12 23:44:58,774 INFO L431 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 [2024-10-12 23:44:58,777 INFO L432 NwaCegarLoop]: 1013 mSDtfsCounter, 0 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:44:58,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3034 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:44:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-12 23:44:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2024-10-12 23:44:58,838 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) [2024-10-12 23:44:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1018 transitions. [2024-10-12 23:44:58,844 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1018 transitions. Word has length 120 [2024-10-12 23:44:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:44:58,845 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1018 transitions. [2024-10-12 23:44:58,845 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) [2024-10-12 23:44:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1018 transitions. [2024-10-12 23:44:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 23:44:58,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:44:58,849 INFO L215 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] [2024-10-12 23:44:58,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:44:58,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:44:58,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:44:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1076836566, now seen corresponding path program 1 times [2024-10-12 23:44:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:44:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110725954] [2024-10-12 23:44:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:44:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:44:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:44:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:44:59,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:44:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110725954] [2024-10-12 23:44:59,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110725954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:44:59,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:44:59,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:44:59,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966660831] [2024-10-12 23:44:59,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:44:59,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:44:59,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:44:59,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:44:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:44:59,317 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) [2024-10-12 23:44:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:44:59,366 INFO L93 Difference]: Finished difference Result 1311 states and 1960 transitions. [2024-10-12 23:44:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:44:59,366 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 [2024-10-12 23:44:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:44:59,372 INFO L225 Difference]: With dead ends: 1311 [2024-10-12 23:44:59,372 INFO L226 Difference]: Without dead ends: 683 [2024-10-12 23:44:59,378 INFO L431 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 [2024-10-12 23:44:59,379 INFO L432 NwaCegarLoop]: 1013 mSDtfsCounter, 0 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:44:59,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3031 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:44:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-10-12 23:44:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2024-10-12 23:44:59,413 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) [2024-10-12 23:44:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1020 transitions. [2024-10-12 23:44:59,416 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1020 transitions. Word has length 121 [2024-10-12 23:44:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:44:59,416 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1020 transitions. [2024-10-12 23:44:59,416 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) [2024-10-12 23:44:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1020 transitions. [2024-10-12 23:44:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 23:44:59,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:44:59,419 INFO L215 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] [2024-10-12 23:44:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:44:59,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:44:59,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:44:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2075770010, now seen corresponding path program 1 times [2024-10-12 23:44:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:44:59,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047681179] [2024-10-12 23:44:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:44:59,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:44:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:00,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:00,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047681179] [2024-10-12 23:45:00,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047681179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:00,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:00,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:00,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576534749] [2024-10-12 23:45:00,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:45:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:00,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:45:00,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:00,496 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) [2024-10-12 23:45:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:00,595 INFO L93 Difference]: Finished difference Result 1453 states and 2171 transitions. [2024-10-12 23:45:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:45:00,595 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 [2024-10-12 23:45:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:00,599 INFO L225 Difference]: With dead ends: 1453 [2024-10-12 23:45:00,599 INFO L226 Difference]: Without dead ends: 823 [2024-10-12 23:45:00,600 INFO L431 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 [2024-10-12 23:45:00,601 INFO L432 NwaCegarLoop]: 1011 mSDtfsCounter, 137 mSDsluCounter, 4032 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 5043 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:00,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 5043 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-10-12 23:45:00,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 820. [2024-10-12 23:45:00,615 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) [2024-10-12 23:45:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1224 transitions. [2024-10-12 23:45:00,619 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1224 transitions. Word has length 122 [2024-10-12 23:45:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:00,620 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1224 transitions. [2024-10-12 23:45:00,620 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) [2024-10-12 23:45:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1224 transitions. [2024-10-12 23:45:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 23:45:00,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:00,624 INFO L215 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] [2024-10-12 23:45:00,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:45:00,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:00,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash 984526685, now seen corresponding path program 1 times [2024-10-12 23:45:00,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:00,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794830526] [2024-10-12 23:45:00,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:01,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:01,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794830526] [2024-10-12 23:45:01,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794830526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:01,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:01,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 23:45:01,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428044823] [2024-10-12 23:45:01,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:01,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:45:01,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:01,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:45:01,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:45:01,514 INFO L87 Difference]: Start difference. First operand 820 states and 1224 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) 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) [2024-10-12 23:45:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:01,616 INFO L93 Difference]: Finished difference Result 1595 states and 2381 transitions. [2024-10-12 23:45:01,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:45:01,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) 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 [2024-10-12 23:45:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:01,621 INFO L225 Difference]: With dead ends: 1595 [2024-10-12 23:45:01,621 INFO L226 Difference]: Without dead ends: 828 [2024-10-12 23:45:01,623 INFO L431 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 [2024-10-12 23:45:01,624 INFO L432 NwaCegarLoop]: 1007 mSDtfsCounter, 137 mSDsluCounter, 5025 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 6032 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:01,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 6032 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-10-12 23:45:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 827. [2024-10-12 23:45:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 826 states have (on average 1.4939467312348669) internal successors, (1234), 826 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1234 transitions. [2024-10-12 23:45:01,641 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1234 transitions. Word has length 123 [2024-10-12 23:45:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:01,642 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1234 transitions. [2024-10-12 23:45:01,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) 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) [2024-10-12 23:45:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1234 transitions. [2024-10-12 23:45:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 23:45:01,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:01,643 INFO L215 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] [2024-10-12 23:45:01,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:45:01,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:01,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:01,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1501906770, now seen corresponding path program 1 times [2024-10-12 23:45:01,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:01,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671445283] [2024-10-12 23:45:01,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:01,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:02,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:02,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671445283] [2024-10-12 23:45:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671445283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:02,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:02,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598714147] [2024-10-12 23:45:02,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:02,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:45:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:45:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:02,119 INFO L87 Difference]: Start difference. First operand 827 states and 1234 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:02,203 INFO L93 Difference]: Finished difference Result 1619 states and 2416 transitions. [2024-10-12 23:45:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:02,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-10-12 23:45:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:02,207 INFO L225 Difference]: With dead ends: 1619 [2024-10-12 23:45:02,207 INFO L226 Difference]: Without dead ends: 845 [2024-10-12 23:45:02,209 INFO L431 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 [2024-10-12 23:45:02,210 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 16 mSDsluCounter, 4034 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5046 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:02,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5046 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-12 23:45:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2024-10-12 23:45:02,234 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) [2024-10-12 23:45:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1260 transitions. [2024-10-12 23:45:02,239 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1260 transitions. Word has length 123 [2024-10-12 23:45:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:02,240 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1260 transitions. [2024-10-12 23:45:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1260 transitions. [2024-10-12 23:45:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 23:45:02,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:02,242 INFO L215 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] [2024-10-12 23:45:02,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:45:02,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:02,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1650234147, now seen corresponding path program 1 times [2024-10-12 23:45:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:02,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111383390] [2024-10-12 23:45:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111383390] [2024-10-12 23:45:02,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111383390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:02,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:02,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:45:02,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720139458] [2024-10-12 23:45:02,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:02,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:02,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:02,979 INFO L87 Difference]: Start difference. First operand 845 states and 1260 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 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) [2024-10-12 23:45:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:03,107 INFO L93 Difference]: Finished difference Result 1639 states and 2444 transitions. [2024-10-12 23:45:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 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 [2024-10-12 23:45:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:03,110 INFO L225 Difference]: With dead ends: 1639 [2024-10-12 23:45:03,111 INFO L226 Difference]: Without dead ends: 847 [2024-10-12 23:45:03,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:03,116 INFO L432 NwaCegarLoop]: 1002 mSDtfsCounter, 987 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:03,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 2998 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-12 23:45:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2024-10-12 23:45:03,133 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) [2024-10-12 23:45:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1262 transitions. [2024-10-12 23:45:03,136 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1262 transitions. Word has length 124 [2024-10-12 23:45:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:03,136 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1262 transitions. [2024-10-12 23:45:03,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 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) [2024-10-12 23:45:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1262 transitions. [2024-10-12 23:45:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 23:45:03,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:03,140 INFO L215 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] [2024-10-12 23:45:03,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:45:03,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:03,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1042326649, now seen corresponding path program 1 times [2024-10-12 23:45:03,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:03,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891172016] [2024-10-12 23:45:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:04,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:04,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891172016] [2024-10-12 23:45:04,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891172016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:04,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:04,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629580603] [2024-10-12 23:45:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:04,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:45:04,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:04,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:45:04,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:45:04,062 INFO L87 Difference]: Start difference. First operand 847 states and 1262 transitions. Second operand has 7 states, 7 states have (on average 17.857142857142858) 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) [2024-10-12 23:45:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:04,314 INFO L93 Difference]: Finished difference Result 1978 states and 2942 transitions. [2024-10-12 23:45:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:45:04,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) 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 [2024-10-12 23:45:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:04,320 INFO L225 Difference]: With dead ends: 1978 [2024-10-12 23:45:04,320 INFO L226 Difference]: Without dead ends: 1184 [2024-10-12 23:45:04,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:45:04,323 INFO L432 NwaCegarLoop]: 1001 mSDtfsCounter, 1953 mSDsluCounter, 3991 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 4992 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:04,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 4992 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:45:04,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-10-12 23:45:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 851. [2024-10-12 23:45:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.4917647058823529) internal successors, (1268), 850 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1268 transitions. [2024-10-12 23:45:04,345 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1268 transitions. Word has length 125 [2024-10-12 23:45:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:04,346 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1268 transitions. [2024-10-12 23:45:04,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) 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) [2024-10-12 23:45:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1268 transitions. [2024-10-12 23:45:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 23:45:04,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:04,348 INFO L215 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] [2024-10-12 23:45:04,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:45:04,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:04,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1736960225, now seen corresponding path program 1 times [2024-10-12 23:45:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:04,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421296182] [2024-10-12 23:45:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:04,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421296182] [2024-10-12 23:45:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421296182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:04,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:04,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811912543] [2024-10-12 23:45:04,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:04,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:45:04,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:04,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:45:04,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:04,794 INFO L87 Difference]: Start difference. First operand 851 states and 1268 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) [2024-10-12 23:45:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:04,851 INFO L93 Difference]: Finished difference Result 1661 states and 2475 transitions. [2024-10-12 23:45:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:04,852 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 [2024-10-12 23:45:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:04,856 INFO L225 Difference]: With dead ends: 1661 [2024-10-12 23:45:04,856 INFO L226 Difference]: Without dead ends: 863 [2024-10-12 23:45:04,859 INFO L431 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 [2024-10-12 23:45:04,860 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 4 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4039 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:04,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4039 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-12 23:45:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2024-10-12 23:45:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.4895591647331787) internal successors, (1284), 862 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1284 transitions. [2024-10-12 23:45:04,881 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1284 transitions. Word has length 125 [2024-10-12 23:45:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:04,881 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1284 transitions. [2024-10-12 23:45:04,881 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) [2024-10-12 23:45:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1284 transitions. [2024-10-12 23:45:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 23:45:04,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:04,883 INFO L215 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] [2024-10-12 23:45:04,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 23:45:04,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:04,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2036365739, now seen corresponding path program 1 times [2024-10-12 23:45:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:04,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904094973] [2024-10-12 23:45:04,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:04,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904094973] [2024-10-12 23:45:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904094973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:05,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112990034] [2024-10-12 23:45:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:05,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:45:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:45:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:05,321 INFO L87 Difference]: Start difference. First operand 863 states and 1284 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:05,380 INFO L93 Difference]: Finished difference Result 1709 states and 2543 transitions. [2024-10-12 23:45:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:05,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2024-10-12 23:45:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:05,387 INFO L225 Difference]: With dead ends: 1709 [2024-10-12 23:45:05,387 INFO L226 Difference]: Without dead ends: 899 [2024-10-12 23:45:05,388 INFO L431 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 [2024-10-12 23:45:05,389 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 16 mSDsluCounter, 4034 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5046 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:05,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5046 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-10-12 23:45:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2024-10-12 23:45:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.487750556792873) internal successors, (1336), 898 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1336 transitions. [2024-10-12 23:45:05,409 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1336 transitions. Word has length 126 [2024-10-12 23:45:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:05,409 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1336 transitions. [2024-10-12 23:45:05,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1336 transitions. [2024-10-12 23:45:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 23:45:05,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:05,412 INFO L215 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] [2024-10-12 23:45:05,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 23:45:05,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:05,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1321281916, now seen corresponding path program 1 times [2024-10-12 23:45:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428950455] [2024-10-12 23:45:05,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:05,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:06,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:06,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428950455] [2024-10-12 23:45:06,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428950455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:06,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:06,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:06,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386324149] [2024-10-12 23:45:06,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:06,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:45:06,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:06,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:45:06,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:45:06,284 INFO L87 Difference]: Start difference. First operand 899 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:06,690 INFO L93 Difference]: Finished difference Result 2106 states and 3124 transitions. [2024-10-12 23:45:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:45:06,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2024-10-12 23:45:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:06,695 INFO L225 Difference]: With dead ends: 2106 [2024-10-12 23:45:06,695 INFO L226 Difference]: Without dead ends: 1260 [2024-10-12 23:45:06,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:45:06,697 INFO L432 NwaCegarLoop]: 1433 mSDtfsCounter, 1468 mSDsluCounter, 5246 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 6679 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:06,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 6679 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:45:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2024-10-12 23:45:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 899. [2024-10-12 23:45:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.487750556792873) internal successors, (1336), 898 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1336 transitions. [2024-10-12 23:45:06,714 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1336 transitions. Word has length 126 [2024-10-12 23:45:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:06,714 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1336 transitions. [2024-10-12 23:45:06,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1336 transitions. [2024-10-12 23:45:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 23:45:06,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:06,716 INFO L215 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] [2024-10-12 23:45:06,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 23:45:06,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:06,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:06,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2066819068, now seen corresponding path program 1 times [2024-10-12 23:45:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:06,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545872920] [2024-10-12 23:45:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:07,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545872920] [2024-10-12 23:45:07,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545872920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:07,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:07,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:07,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412024797] [2024-10-12 23:45:07,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:07,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:45:07,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:07,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:45:07,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:07,076 INFO L87 Difference]: Start difference. First operand 899 states and 1336 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) [2024-10-12 23:45:07,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:07,140 INFO L93 Difference]: Finished difference Result 1757 states and 2611 transitions. [2024-10-12 23:45:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:07,141 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 [2024-10-12 23:45:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:07,144 INFO L225 Difference]: With dead ends: 1757 [2024-10-12 23:45:07,145 INFO L226 Difference]: Without dead ends: 911 [2024-10-12 23:45:07,146 INFO L431 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 [2024-10-12 23:45:07,147 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 4 mSDsluCounter, 4034 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5046 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:07,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5046 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2024-10-12 23:45:07,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 911. [2024-10-12 23:45:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 910 states have (on average 1.4857142857142858) internal successors, (1352), 910 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1352 transitions. [2024-10-12 23:45:07,163 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1352 transitions. Word has length 127 [2024-10-12 23:45:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:07,163 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1352 transitions. [2024-10-12 23:45:07,164 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) [2024-10-12 23:45:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1352 transitions. [2024-10-12 23:45:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 23:45:07,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:07,165 INFO L215 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] [2024-10-12 23:45:07,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 23:45:07,166 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:07,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash -514400036, now seen corresponding path program 1 times [2024-10-12 23:45:07,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:07,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512194113] [2024-10-12 23:45:07,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:07,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:07,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512194113] [2024-10-12 23:45:07,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512194113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:07,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:07,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:45:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945174621] [2024-10-12 23:45:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:07,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:07,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:07,896 INFO L87 Difference]: Start difference. First operand 911 states and 1352 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 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) [2024-10-12 23:45:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:08,039 INFO L93 Difference]: Finished difference Result 2080 states and 3080 transitions. [2024-10-12 23:45:08,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:08,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 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 [2024-10-12 23:45:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:08,045 INFO L225 Difference]: With dead ends: 2080 [2024-10-12 23:45:08,045 INFO L226 Difference]: Without dead ends: 1222 [2024-10-12 23:45:08,046 INFO L431 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 [2024-10-12 23:45:08,047 INFO L432 NwaCegarLoop]: 1002 mSDtfsCounter, 454 mSDsluCounter, 2921 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:08,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 3923 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-10-12 23:45:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 913. [2024-10-12 23:45:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.4846491228070176) internal successors, (1354), 912 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1354 transitions. [2024-10-12 23:45:08,071 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1354 transitions. Word has length 127 [2024-10-12 23:45:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:08,072 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1354 transitions. [2024-10-12 23:45:08,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 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) [2024-10-12 23:45:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1354 transitions. [2024-10-12 23:45:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 23:45:08,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:08,074 INFO L215 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] [2024-10-12 23:45:08,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 23:45:08,075 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:08,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:08,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2139267367, now seen corresponding path program 1 times [2024-10-12 23:45:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:08,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052040896] [2024-10-12 23:45:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:08,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052040896] [2024-10-12 23:45:08,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052040896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:08,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:08,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:45:08,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601941535] [2024-10-12 23:45:08,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:08,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:08,513 INFO L87 Difference]: Start difference. First operand 913 states and 1354 transitions. Second operand has 5 states, 5 states have (on average 25.6) 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) [2024-10-12 23:45:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:08,573 INFO L93 Difference]: Finished difference Result 1807 states and 2681 transitions. [2024-10-12 23:45:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:08,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) 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 [2024-10-12 23:45:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:08,578 INFO L225 Difference]: With dead ends: 1807 [2024-10-12 23:45:08,578 INFO L226 Difference]: Without dead ends: 949 [2024-10-12 23:45:08,580 INFO L431 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 [2024-10-12 23:45:08,581 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 16 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4039 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:08,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4039 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-10-12 23:45:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2024-10-12 23:45:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 1.4831223628691983) internal successors, (1406), 948 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1406 transitions. [2024-10-12 23:45:08,603 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1406 transitions. Word has length 128 [2024-10-12 23:45:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:08,603 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1406 transitions. [2024-10-12 23:45:08,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) 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) [2024-10-12 23:45:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1406 transitions. [2024-10-12 23:45:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 23:45:08,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:08,605 INFO L215 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] [2024-10-12 23:45:08,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 23:45:08,606 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:08,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash -482109689, now seen corresponding path program 1 times [2024-10-12 23:45:08,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:08,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483530781] [2024-10-12 23:45:08,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:08,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:08,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:08,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483530781] [2024-10-12 23:45:08,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483530781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:08,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:08,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040859817] [2024-10-12 23:45:08,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:08,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:45:08,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:08,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:45:08,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:08,979 INFO L87 Difference]: Start difference. First operand 949 states and 1406 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 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) [2024-10-12 23:45:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:09,037 INFO L93 Difference]: Finished difference Result 1855 states and 2749 transitions. [2024-10-12 23:45:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:09,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 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 [2024-10-12 23:45:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:09,041 INFO L225 Difference]: With dead ends: 1855 [2024-10-12 23:45:09,041 INFO L226 Difference]: Without dead ends: 961 [2024-10-12 23:45:09,042 INFO L431 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 [2024-10-12 23:45:09,043 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 4 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4039 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:09,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4039 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-10-12 23:45:09,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2024-10-12 23:45:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 1.48125) internal successors, (1422), 960 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1422 transitions. [2024-10-12 23:45:09,064 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1422 transitions. Word has length 129 [2024-10-12 23:45:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:09,065 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1422 transitions. [2024-10-12 23:45:09,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 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) [2024-10-12 23:45:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1422 transitions. [2024-10-12 23:45:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 23:45:09,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:09,067 INFO L215 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] [2024-10-12 23:45:09,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 23:45:09,067 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:09,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash -991551975, now seen corresponding path program 1 times [2024-10-12 23:45:09,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:09,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845732288] [2024-10-12 23:45:09,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:09,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:09,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:09,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845732288] [2024-10-12 23:45:09,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845732288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:09,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:09,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:45:09,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158075832] [2024-10-12 23:45:09,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:09,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:09,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:09,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:09,446 INFO L87 Difference]: Start difference. First operand 961 states and 1422 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 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) [2024-10-12 23:45:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:09,493 INFO L93 Difference]: Finished difference Result 1903 states and 2817 transitions. [2024-10-12 23:45:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:09,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 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 [2024-10-12 23:45:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:09,497 INFO L225 Difference]: With dead ends: 1903 [2024-10-12 23:45:09,497 INFO L226 Difference]: Without dead ends: 997 [2024-10-12 23:45:09,499 INFO L431 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 [2024-10-12 23:45:09,500 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 16 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4039 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:09,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4039 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-12 23:45:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2024-10-12 23:45:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 996 states have (on average 1.4799196787148594) internal successors, (1474), 996 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1474 transitions. [2024-10-12 23:45:09,519 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1474 transitions. Word has length 130 [2024-10-12 23:45:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:09,519 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1474 transitions. [2024-10-12 23:45:09,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 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) [2024-10-12 23:45:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1474 transitions. [2024-10-12 23:45:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 23:45:09,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:09,521 INFO L215 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] [2024-10-12 23:45:09,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 23:45:09,521 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:09,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1430547946, now seen corresponding path program 1 times [2024-10-12 23:45:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:09,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672718534] [2024-10-12 23:45:09,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:09,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:09,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:09,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672718534] [2024-10-12 23:45:09,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672718534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:09,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:09,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:45:09,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882355214] [2024-10-12 23:45:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:09,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:09,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:09,856 INFO L87 Difference]: Start difference. First operand 997 states and 1474 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) [2024-10-12 23:45:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:09,906 INFO L93 Difference]: Finished difference Result 1951 states and 2885 transitions. [2024-10-12 23:45:09,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:09,907 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 [2024-10-12 23:45:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:09,911 INFO L225 Difference]: With dead ends: 1951 [2024-10-12 23:45:09,911 INFO L226 Difference]: Without dead ends: 1009 [2024-10-12 23:45:09,912 INFO L431 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 [2024-10-12 23:45:09,913 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 4 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4039 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:09,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4039 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-12 23:45:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2024-10-12 23:45:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4781746031746033) internal successors, (1490), 1008 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1490 transitions. [2024-10-12 23:45:09,931 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1490 transitions. Word has length 131 [2024-10-12 23:45:09,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:09,931 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1490 transitions. [2024-10-12 23:45:09,932 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) [2024-10-12 23:45:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1490 transitions. [2024-10-12 23:45:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 23:45:09,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:09,933 INFO L215 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] [2024-10-12 23:45:09,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 23:45:09,934 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:09,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1023980843, now seen corresponding path program 1 times [2024-10-12 23:45:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:09,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912045996] [2024-10-12 23:45:09,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:09,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:10,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:10,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912045996] [2024-10-12 23:45:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912045996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:10,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:10,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:45:10,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351178756] [2024-10-12 23:45:10,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:10,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:10,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:10,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:10,282 INFO L87 Difference]: Start difference. First operand 1009 states and 1490 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) [2024-10-12 23:45:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:10,329 INFO L93 Difference]: Finished difference Result 1999 states and 2953 transitions. [2024-10-12 23:45:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:10,330 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 [2024-10-12 23:45:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:10,333 INFO L225 Difference]: With dead ends: 1999 [2024-10-12 23:45:10,333 INFO L226 Difference]: Without dead ends: 1045 [2024-10-12 23:45:10,335 INFO L431 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 [2024-10-12 23:45:10,335 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 16 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4039 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:10,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4039 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2024-10-12 23:45:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1045. [2024-10-12 23:45:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1044 states have (on average 1.4770114942528736) internal successors, (1542), 1044 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1542 transitions. [2024-10-12 23:45:10,355 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1542 transitions. Word has length 132 [2024-10-12 23:45:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:10,355 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1542 transitions. [2024-10-12 23:45:10,355 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) [2024-10-12 23:45:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1542 transitions. [2024-10-12 23:45:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 23:45:10,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:10,357 INFO L215 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] [2024-10-12 23:45:10,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 23:45:10,357 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:10,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1858231123, now seen corresponding path program 1 times [2024-10-12 23:45:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:10,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285693560] [2024-10-12 23:45:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:13,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:13,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285693560] [2024-10-12 23:45:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285693560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:13,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:13,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2024-10-12 23:45:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114932114] [2024-10-12 23:45:13,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:13,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-12 23:45:13,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:13,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-12 23:45:13,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 23:45:13,459 INFO L87 Difference]: Start difference. First operand 1045 states and 1542 transitions. Second operand has 37 states, 37 states have (on average 3.5945945945945947) internal successors, (133), 36 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) [2024-10-12 23:45:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:16,469 INFO L93 Difference]: Finished difference Result 2165 states and 3197 transitions. [2024-10-12 23:45:16,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-12 23:45:16,470 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.5945945945945947) internal successors, (133), 36 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 [2024-10-12 23:45:16,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:16,474 INFO L225 Difference]: With dead ends: 2165 [2024-10-12 23:45:16,474 INFO L226 Difference]: Without dead ends: 1175 [2024-10-12 23:45:16,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=253, Invalid=4169, Unknown=0, NotChecked=0, Total=4422 [2024-10-12 23:45:16,478 INFO L432 NwaCegarLoop]: 932 mSDtfsCounter, 1759 mSDsluCounter, 31719 mSDsCounter, 0 mSdLazyCounter, 2908 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 32651 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:16,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 32651 Invalid, 2937 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 2908 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 23:45:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2024-10-12 23:45:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1172. [2024-10-12 23:45:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.4790777113578137) internal successors, (1732), 1171 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1732 transitions. [2024-10-12 23:45:16,502 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1732 transitions. Word has length 133 [2024-10-12 23:45:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:16,503 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1732 transitions. [2024-10-12 23:45:16,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.5945945945945947) internal successors, (133), 36 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) [2024-10-12 23:45:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1732 transitions. [2024-10-12 23:45:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-12 23:45:16,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:16,505 INFO L215 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] [2024-10-12 23:45:16,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 23:45:16,505 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:16,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash -206044110, now seen corresponding path program 1 times [2024-10-12 23:45:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:16,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339941889] [2024-10-12 23:45:16,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:16,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:18,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:18,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339941889] [2024-10-12 23:45:18,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339941889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:18,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:18,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:18,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530197261] [2024-10-12 23:45:18,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:18,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:45:18,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:18,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:45:18,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:45:18,323 INFO L87 Difference]: Start difference. First operand 1172 states and 1732 transitions. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 6 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) [2024-10-12 23:45:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:18,437 INFO L93 Difference]: Finished difference Result 2305 states and 3407 transitions. [2024-10-12 23:45:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:45:18,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 6 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 [2024-10-12 23:45:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:18,442 INFO L225 Difference]: With dead ends: 2305 [2024-10-12 23:45:18,442 INFO L226 Difference]: Without dead ends: 1188 [2024-10-12 23:45:18,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:45:18,445 INFO L432 NwaCegarLoop]: 1005 mSDtfsCounter, 993 mSDsluCounter, 3999 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 5004 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:18,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 5004 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2024-10-12 23:45:18,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1182. [2024-10-12 23:45:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.4767146486028788) internal successors, (1744), 1181 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1744 transitions. [2024-10-12 23:45:18,468 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1744 transitions. Word has length 134 [2024-10-12 23:45:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:18,469 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1744 transitions. [2024-10-12 23:45:18,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 6 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) [2024-10-12 23:45:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1744 transitions. [2024-10-12 23:45:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 23:45:18,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:18,470 INFO L215 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] [2024-10-12 23:45:18,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 23:45:18,471 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:18,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash 369518885, now seen corresponding path program 1 times [2024-10-12 23:45:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441260507] [2024-10-12 23:45:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:45:18,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:45:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:45:19,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:45:19,153 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:45:19,154 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:45:19,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 23:45:19,158 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:19,275 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:45:19,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:45:19 BoogieIcfgContainer [2024-10-12 23:45:19,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:45:19,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:45:19,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:45:19,279 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:45:19,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:44:57" (3/4) ... [2024-10-12 23:45:19,281 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:45:19,282 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:45:19,283 INFO L158 Benchmark]: Toolchain (without parser) took 26668.11ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 86.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 187.2MB. Max. memory is 16.1GB. [2024-10-12 23:45:19,283 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 114.5MB in the end (delta: 169.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:45:19,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.36ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 86.0MB in the beginning and 130.0MB in the end (delta: -44.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 23:45:19,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 470.99ms. Allocated memory is still 199.2MB. Free memory was 130.0MB in the beginning and 120.7MB in the end (delta: 9.3MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2024-10-12 23:45:19,283 INFO L158 Benchmark]: Boogie Preprocessor took 473.73ms. Allocated memory is still 199.2MB. Free memory was 120.7MB in the beginning and 86.6MB in the end (delta: 34.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-12 23:45:19,284 INFO L158 Benchmark]: RCFGBuilder took 2781.59ms. Allocated memory was 199.2MB in the beginning and 364.9MB in the end (delta: 165.7MB). Free memory was 86.6MB in the beginning and 141.0MB in the end (delta: -54.4MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. [2024-10-12 23:45:19,284 INFO L158 Benchmark]: TraceAbstraction took 22162.01ms. Allocated memory was 364.9MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 141.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-10-12 23:45:19,284 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 1.5GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:45:19,285 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.19ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 114.5MB in the end (delta: 169.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.36ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 86.0MB in the beginning and 130.0MB in the end (delta: -44.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 470.99ms. Allocated memory is still 199.2MB. Free memory was 130.0MB in the beginning and 120.7MB in the end (delta: 9.3MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 473.73ms. Allocated memory is still 199.2MB. Free memory was 120.7MB in the beginning and 86.6MB in the end (delta: 34.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2781.59ms. Allocated memory was 199.2MB in the beginning and 364.9MB in the end (delta: 165.7MB). Free memory was 86.6MB in the beginning and 141.0MB in the end (delta: -54.4MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. * TraceAbstraction took 22162.01ms. Allocated memory was 364.9MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 141.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 1.5GB. Free memory is still 1.2GB. 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, 680 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7984 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7984 mSDsluCounter, 112759 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93232 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3894 IncrementalHoareTripleChecker+Invalid, 3933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 19527 mSDtfsCounter, 3894 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1182occurred in iteration=19, InterpolantAutomatonStates: 132, 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, 19 MinimizatonAttempts, 1016 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 2541 NumberOfCodeBlocks, 2541 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2387 ConstructedInterpolants, 0 QuantifiedInterpolants, 5483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 23:45:19,334 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/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:45:21,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:45:21,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 23:45:21,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:45:21,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:45:21,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:45:21,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:45:21,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:45:21,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:45:21,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:45:21,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:45:21,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:45:21,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:45:21,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:45:21,746 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:45:21,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:45:21,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:45:21,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:45:21,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:45:21,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:45:21,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:45:21,752 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:45:21,752 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:45:21,752 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:45:21,753 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:45:21,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:45:21,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:45:21,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:45:21,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:45:21,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:45:21,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:45:21,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:45:21,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:45:21,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:45:21,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:45:21,757 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:45:21,757 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:45:21,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:45:21,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:45:21,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:45:21,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:45:21,759 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:45:21,759 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-12 23:45:22,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:45:22,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:45:22,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:45:22,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:45:22,133 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:45:22,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2024-10-12 23:45:23,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:45:23,928 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:45:23,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2024-10-12 23:45:23,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ba64c9d/9fea7c1fe92342719a57d1f422449443/FLAGade39ef2b [2024-10-12 23:45:24,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ba64c9d/9fea7c1fe92342719a57d1f422449443 [2024-10-12 23:45:24,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:45:24,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:45:24,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:45:24,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:45:24,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:45:24,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:24,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f3abc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24, skipping insertion in model container [2024-10-12 23:45:24,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:24,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:45:24,561 WARN L248 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] [2024-10-12 23:45:24,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:45:24,839 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:45:24,850 WARN L248 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] [2024-10-12 23:45:24,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:45:24,976 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:45:24,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24 WrapperNode [2024-10-12 23:45:24,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:45:24,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:45:24,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:45:24,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:45:24,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,120 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1256 [2024-10-12 23:45:25,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:45:25,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:45:25,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:45:25,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:45:25,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,195 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]. [2024-10-12 23:45:25,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:45:25,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:45:25,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:45:25,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:45:25,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (1/1) ... [2024-10-12 23:45:25,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:45:25,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:45:25,343 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) [2024-10-12 23:45:25,346 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 [2024-10-12 23:45:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:45:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:45:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:45:25,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:45:25,692 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:45:25,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:45:27,105 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2024-10-12 23:45:27,106 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:45:27,163 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:45:27,164 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:45:27,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:45:27 BoogieIcfgContainer [2024-10-12 23:45:27,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:45:27,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:45:27,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:45:27,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:45:27,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:45:24" (1/3) ... [2024-10-12 23:45:27,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a45d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:45:27, skipping insertion in model container [2024-10-12 23:45:27,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:24" (2/3) ... [2024-10-12 23:45:27,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a45d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:45:27, skipping insertion in model container [2024-10-12 23:45:27,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:45:27" (3/3) ... [2024-10-12 23:45:27,172 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c [2024-10-12 23:45:27,189 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:45:27,190 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:45:27,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:45:27,262 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;@62203829, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:45:27,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:45:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2024-10-12 23:45:27,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 23:45:27,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:27,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 23:45:27,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:27,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 23:45:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:45:27,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243347860] [2024-10-12 23:45:27,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:27,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:45:27,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:45:27,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:45:27,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:45:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:27,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 23:45:27,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:45:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:27,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:45:27,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:45:27,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243347860] [2024-10-12 23:45:27,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243347860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:27,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:27,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:45:27,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610770393] [2024-10-12 23:45:27,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:27,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:45:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:45:28,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:45:28,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:28,005 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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) 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) [2024-10-12 23:45:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:28,134 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 23:45:28,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:28,137 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 [2024-10-12 23:45:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:28,144 INFO L225 Difference]: With dead ends: 15 [2024-10-12 23:45:28,144 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 23:45:28,146 INFO L431 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 [2024-10-12 23:45:28,150 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:28,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 23:45:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 23:45:28,202 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) [2024-10-12 23:45:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 23:45:28,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 23:45:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:28,205 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 23:45:28,205 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) [2024-10-12 23:45:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 23:45:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 23:45:28,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:28,206 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 23:45:28,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 23:45:28,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:45:28,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:28,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 23:45:28,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:45:28,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395288807] [2024-10-12 23:45:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:28,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:45:28,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:45:28,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:45:28,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:45:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:29,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-12 23:45:29,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:45:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:29,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:45:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:31,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:45:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395288807] [2024-10-12 23:45:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395288807] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:45:31,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:45:31,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 23:45:31,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727055657] [2024-10-12 23:45:31,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:45:31,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:45:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:45:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:45:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:45:31,477 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:32,203 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-12 23:45:32,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:45:32,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 7 [2024-10-12 23:45:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:32,204 INFO L225 Difference]: With dead ends: 17 [2024-10-12 23:45:32,204 INFO L226 Difference]: Without dead ends: 15 [2024-10-12 23:45:32,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:45:32,205 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:32,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 12 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:45:32,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-12 23:45:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-12 23:45:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-12 23:45:32,211 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-12 23:45:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:32,212 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-12 23:45:32,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-12 23:45:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 23:45:32,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:32,213 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-12 23:45:32,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:45:32,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:45:32,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:32,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-12 23:45:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:45:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009361584] [2024-10-12 23:45:32,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 23:45:32,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:45:32,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:45:32,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:45:32,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 23:45:35,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 23:45:35,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 23:45:35,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 206 conjuncts are in the unsatisfiable core [2024-10-12 23:45:35,246 INFO L278 TraceCheckSpWp]: Computing forward predicates...