./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 01076893d0875072ea1a0a9ca67dbc9f3276dc5a34f6337d5335f830cd00f921 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:43:22,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:43:22,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:43:22,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:43:22,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:43:22,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:43:22,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:43:22,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:43:22,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:43:22,490 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:43:22,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:43:22,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:43:22,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:43:22,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:43:22,491 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:43:22,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:43:22,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:43:22,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:43:22,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:43:22,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:43:22,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:43:22,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:43:22,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:43:22,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:43:22,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:43:22,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:43:22,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:43:22,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:43:22,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:43:22,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:43:22,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:43:22,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:43:22,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:43:22,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:43:22,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:43:22,494 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:43:22,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:43:22,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:43:22,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:43:22,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:43:22,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:43:22,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:43:22,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:43:22,495 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01076893d0875072ea1a0a9ca67dbc9f3276dc5a34f6337d5335f830cd00f921 [2025-03-03 20:43:22,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:43:22,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:43:22,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:43:22,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:43:22,720 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:43:22,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i [2025-03-03 20:43:23,877 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70db7f11d/825dc4e5d5d84a79af0b7d4772f69317/FLAG3e39f7afa [2025-03-03 20:43:24,124 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:43:24,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i [2025-03-03 20:43:24,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70db7f11d/825dc4e5d5d84a79af0b7d4772f69317/FLAG3e39f7afa [2025-03-03 20:43:24,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70db7f11d/825dc4e5d5d84a79af0b7d4772f69317 [2025-03-03 20:43:24,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:43:24,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:43:24,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:43:24,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:43:24,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:43:24,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d3808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24, skipping insertion in model container [2025-03-03 20:43:24,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:43:24,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i[919,932] [2025-03-03 20:43:24,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:43:24,360 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:43:24,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i[919,932] [2025-03-03 20:43:24,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:43:24,404 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:43:24,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24 WrapperNode [2025-03-03 20:43:24,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:43:24,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:43:24,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:43:24,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:43:24,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,447 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 306 [2025-03-03 20:43:24,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:43:24,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:43:24,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:43:24,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:43:24,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,482 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:43:24,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:43:24,507 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:43:24,507 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:43:24,507 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:43:24,508 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (1/1) ... [2025-03-03 20:43:24,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:43:24,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:43:24,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:43:24,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:43:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:43:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:43:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:43:24,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:43:24,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:43:24,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:43:24,610 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:43:24,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:43:24,972 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc property_#t~bitwise33#1;havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-03 20:43:25,015 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 20:43:25,015 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:43:25,034 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:43:25,036 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:43:25,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:43:25 BoogieIcfgContainer [2025-03-03 20:43:25,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:43:25,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:43:25,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:43:25,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:43:25,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:43:24" (1/3) ... [2025-03-03 20:43:25,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d62865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:43:25, skipping insertion in model container [2025-03-03 20:43:25,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:24" (2/3) ... [2025-03-03 20:43:25,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d62865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:43:25, skipping insertion in model container [2025-03-03 20:43:25,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:43:25" (3/3) ... [2025-03-03 20:43:25,044 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i [2025-03-03 20:43:25,054 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:43:25,056 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i that has 2 procedures, 127 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:43:25,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:43:25,107 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;@6a2d0198, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:43:25,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:43:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 85 states have internal predecessors, (118), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-03 20:43:25,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:25,123 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:25,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:25,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1113169570, now seen corresponding path program 1 times [2025-03-03 20:43:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:25,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478757858] [2025-03-03 20:43:25,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:25,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-03 20:43:25,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-03 20:43:25,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:25,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-03 20:43:25,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478757858] [2025-03-03 20:43:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478757858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:43:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311333644] [2025-03-03 20:43:25,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:25,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:43:25,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:43:25,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:43:25,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:43:25,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-03 20:43:25,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-03 20:43:25,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:25,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:25,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:43:25,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:43:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-03 20:43:25,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:43:25,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311333644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:25,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:43:25,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:43:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053989361] [2025-03-03 20:43:25,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:25,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:43:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:25,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:43:25,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:43:25,695 INFO L87 Difference]: Start difference. First operand has 127 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 85 states have internal predecessors, (118), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 20:43:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:25,728 INFO L93 Difference]: Finished difference Result 248 states and 431 transitions. [2025-03-03 20:43:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:43:25,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 260 [2025-03-03 20:43:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:25,734 INFO L225 Difference]: With dead ends: 248 [2025-03-03 20:43:25,734 INFO L226 Difference]: Without dead ends: 124 [2025-03-03 20:43:25,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:43:25,742 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:25,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:43:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-03 20:43:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-03 20:43:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 193 transitions. [2025-03-03 20:43:25,788 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 193 transitions. Word has length 260 [2025-03-03 20:43:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:25,789 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 193 transitions. [2025-03-03 20:43:25,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 20:43:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 193 transitions. [2025-03-03 20:43:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-03 20:43:25,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:25,793 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:25,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:43:25,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:43:25,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:25,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1054122164, now seen corresponding path program 1 times [2025-03-03 20:43:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:25,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736832460] [2025-03-03 20:43:25,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:26,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-03 20:43:26,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-03 20:43:26,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:26,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:26,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736832460] [2025-03-03 20:43:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736832460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:26,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:43:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542229764] [2025-03-03 20:43:26,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:26,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:43:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:26,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:43:26,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:26,243 INFO L87 Difference]: Start difference. First operand 124 states and 193 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:26,318 INFO L93 Difference]: Finished difference Result 293 states and 458 transitions. [2025-03-03 20:43:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:43:26,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 260 [2025-03-03 20:43:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:26,321 INFO L225 Difference]: With dead ends: 293 [2025-03-03 20:43:26,323 INFO L226 Difference]: Without dead ends: 172 [2025-03-03 20:43:26,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:26,326 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 65 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:26,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 403 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:43:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-03 20:43:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 137. [2025-03-03 20:43:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 95 states have internal predecessors, (132), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 212 transitions. [2025-03-03 20:43:26,345 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 212 transitions. Word has length 260 [2025-03-03 20:43:26,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:26,346 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 212 transitions. [2025-03-03 20:43:26,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 212 transitions. [2025-03-03 20:43:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-03 20:43:26,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:26,351 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:26,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:43:26,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:26,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1760999636, now seen corresponding path program 1 times [2025-03-03 20:43:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:26,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943488900] [2025-03-03 20:43:26,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:26,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:26,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-03 20:43:26,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-03 20:43:26,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:26,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:27,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:27,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943488900] [2025-03-03 20:43:27,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943488900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:27,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:27,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:43:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795516529] [2025-03-03 20:43:27,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:27,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:43:27,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:27,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:43:27,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:43:27,068 INFO L87 Difference]: Start difference. First operand 137 states and 212 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:27,590 INFO L93 Difference]: Finished difference Result 469 states and 730 transitions. [2025-03-03 20:43:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:43:27,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 260 [2025-03-03 20:43:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:27,597 INFO L225 Difference]: With dead ends: 469 [2025-03-03 20:43:27,597 INFO L226 Difference]: Without dead ends: 335 [2025-03-03 20:43:27,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:43:27,598 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 414 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:27,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 712 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:43:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-03 20:43:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 176. [2025-03-03 20:43:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 134 states have (on average 1.462686567164179) internal successors, (196), 134 states have internal predecessors, (196), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 276 transitions. [2025-03-03 20:43:27,618 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 276 transitions. Word has length 260 [2025-03-03 20:43:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:27,618 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 276 transitions. [2025-03-03 20:43:27,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 276 transitions. [2025-03-03 20:43:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-03 20:43:27,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:27,622 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:27,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:43:27,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:27,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1839911350, now seen corresponding path program 1 times [2025-03-03 20:43:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:27,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178144006] [2025-03-03 20:43:27,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:27,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-03 20:43:27,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-03 20:43:27,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:27,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:28,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:28,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178144006] [2025-03-03 20:43:28,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178144006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:28,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:28,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:43:28,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583316257] [2025-03-03 20:43:28,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:28,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:43:28,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:28,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:43:28,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:43:28,305 INFO L87 Difference]: Start difference. First operand 176 states and 276 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:29,039 INFO L93 Difference]: Finished difference Result 542 states and 847 transitions. [2025-03-03 20:43:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:43:29,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 261 [2025-03-03 20:43:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:29,043 INFO L225 Difference]: With dead ends: 542 [2025-03-03 20:43:29,044 INFO L226 Difference]: Without dead ends: 369 [2025-03-03 20:43:29,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:43:29,046 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 269 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:29,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1551 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:43:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-03 20:43:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 206. [2025-03-03 20:43:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.4939024390243902) internal successors, (245), 164 states have internal predecessors, (245), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 325 transitions. [2025-03-03 20:43:29,065 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 325 transitions. Word has length 261 [2025-03-03 20:43:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:29,066 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 325 transitions. [2025-03-03 20:43:29,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 325 transitions. [2025-03-03 20:43:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-03 20:43:29,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:29,068 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:29,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:43:29,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:29,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:29,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1741770890, now seen corresponding path program 1 times [2025-03-03 20:43:29,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388815827] [2025-03-03 20:43:29,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:29,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:29,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 20:43:29,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 20:43:29,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:29,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:29,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:29,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388815827] [2025-03-03 20:43:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388815827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:29,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:29,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:43:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270168126] [2025-03-03 20:43:29,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:29,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:43:29,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:29,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:43:29,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:43:29,574 INFO L87 Difference]: Start difference. First operand 206 states and 325 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:29,869 INFO L93 Difference]: Finished difference Result 522 states and 821 transitions. [2025-03-03 20:43:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:43:29,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 262 [2025-03-03 20:43:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:29,871 INFO L225 Difference]: With dead ends: 522 [2025-03-03 20:43:29,871 INFO L226 Difference]: Without dead ends: 319 [2025-03-03 20:43:29,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:43:29,872 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 152 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:29,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1453 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:43:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-03 20:43:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 235. [2025-03-03 20:43:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 193 states have (on average 1.5181347150259068) internal successors, (293), 193 states have internal predecessors, (293), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 373 transitions. [2025-03-03 20:43:29,890 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 373 transitions. Word has length 262 [2025-03-03 20:43:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 373 transitions. [2025-03-03 20:43:29,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 373 transitions. [2025-03-03 20:43:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-03 20:43:29,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:29,895 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:29,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:43:29,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:29,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:29,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1963983667, now seen corresponding path program 1 times [2025-03-03 20:43:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77524727] [2025-03-03 20:43:29,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:29,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:29,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 20:43:29,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 20:43:29,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:29,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:30,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:30,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77524727] [2025-03-03 20:43:30,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77524727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:30,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:30,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:43:30,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340437111] [2025-03-03 20:43:30,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:30,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:43:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:30,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:43:30,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:43:30,419 INFO L87 Difference]: Start difference. First operand 235 states and 373 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:30,746 INFO L93 Difference]: Finished difference Result 645 states and 1022 transitions. [2025-03-03 20:43:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:43:30,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 262 [2025-03-03 20:43:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:30,748 INFO L225 Difference]: With dead ends: 645 [2025-03-03 20:43:30,748 INFO L226 Difference]: Without dead ends: 413 [2025-03-03 20:43:30,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:43:30,749 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 216 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:30,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1465 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:43:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-03 20:43:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 258. [2025-03-03 20:43:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 216 states have (on average 1.5) internal successors, (324), 216 states have internal predecessors, (324), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 404 transitions. [2025-03-03 20:43:30,764 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 404 transitions. Word has length 262 [2025-03-03 20:43:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:30,766 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 404 transitions. [2025-03-03 20:43:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 404 transitions. [2025-03-03 20:43:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:43:30,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:30,770 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:30,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:43:30,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:30,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1909437031, now seen corresponding path program 1 times [2025-03-03 20:43:30,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:30,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136933593] [2025-03-03 20:43:30,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:30,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:43:30,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:43:30,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:30,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:31,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136933593] [2025-03-03 20:43:31,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136933593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:31,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:31,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:43:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110744249] [2025-03-03 20:43:31,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:31,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:43:31,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:31,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:43:31,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:43:31,351 INFO L87 Difference]: Start difference. First operand 258 states and 404 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:31,626 INFO L93 Difference]: Finished difference Result 693 states and 1084 transitions. [2025-03-03 20:43:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:43:31,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 263 [2025-03-03 20:43:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:31,629 INFO L225 Difference]: With dead ends: 693 [2025-03-03 20:43:31,629 INFO L226 Difference]: Without dead ends: 438 [2025-03-03 20:43:31,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:43:31,630 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 175 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:31,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1901 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:43:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-03 20:43:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 262. [2025-03-03 20:43:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 409 transitions. [2025-03-03 20:43:31,640 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 409 transitions. Word has length 263 [2025-03-03 20:43:31,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:31,640 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 409 transitions. [2025-03-03 20:43:31,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 409 transitions. [2025-03-03 20:43:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:43:31,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:31,643 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:31,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:43:31,643 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:31,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash 262731925, now seen corresponding path program 1 times [2025-03-03 20:43:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:31,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411574505] [2025-03-03 20:43:31,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:31,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:43:31,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:43:31,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:31,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:32,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411574505] [2025-03-03 20:43:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411574505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:32,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:32,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:43:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000959557] [2025-03-03 20:43:32,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:32,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:43:32,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:32,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:43:32,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:43:32,184 INFO L87 Difference]: Start difference. First operand 262 states and 409 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:32,596 INFO L93 Difference]: Finished difference Result 756 states and 1185 transitions. [2025-03-03 20:43:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:43:32,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 263 [2025-03-03 20:43:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:32,599 INFO L225 Difference]: With dead ends: 756 [2025-03-03 20:43:32,599 INFO L226 Difference]: Without dead ends: 497 [2025-03-03 20:43:32,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:43:32,600 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 348 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:32,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1836 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:43:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-03 20:43:32,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 306. [2025-03-03 20:43:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 264 states have (on average 1.5265151515151516) internal successors, (403), 264 states have internal predecessors, (403), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 483 transitions. [2025-03-03 20:43:32,618 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 483 transitions. Word has length 263 [2025-03-03 20:43:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:32,619 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 483 transitions. [2025-03-03 20:43:32,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 483 transitions. [2025-03-03 20:43:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:43:32,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:32,622 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:32,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:43:32,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:32,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:32,623 INFO L85 PathProgramCache]: Analyzing trace with hash 329546181, now seen corresponding path program 1 times [2025-03-03 20:43:32,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:32,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609071587] [2025-03-03 20:43:32,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:32,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:43:32,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:43:32,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:32,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609071587] [2025-03-03 20:43:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609071587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:32,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:32,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:43:32,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310914198] [2025-03-03 20:43:32,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:32,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:43:32,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:32,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:43:32,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:32,691 INFO L87 Difference]: Start difference. First operand 306 states and 483 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:32,729 INFO L93 Difference]: Finished difference Result 809 states and 1278 transitions. [2025-03-03 20:43:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:43:32,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 263 [2025-03-03 20:43:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:32,731 INFO L225 Difference]: With dead ends: 809 [2025-03-03 20:43:32,731 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 20:43:32,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:32,733 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 164 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:32,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 405 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:43:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 20:43:32,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 342. [2025-03-03 20:43:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 300 states have (on average 1.5266666666666666) internal successors, (458), 300 states have internal predecessors, (458), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 538 transitions. [2025-03-03 20:43:32,751 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 538 transitions. Word has length 263 [2025-03-03 20:43:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:32,752 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 538 transitions. [2025-03-03 20:43:32,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 538 transitions. [2025-03-03 20:43:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:43:32,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:32,754 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:32,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:43:32,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:32,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2096849460, now seen corresponding path program 1 times [2025-03-03 20:43:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:32,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257061602] [2025-03-03 20:43:32,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:32,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:32,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:43:32,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:43:32,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:32,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:32,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:32,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:32,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257061602] [2025-03-03 20:43:32,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257061602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:32,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:43:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673066179] [2025-03-03 20:43:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:32,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:43:32,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:32,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:43:32,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:32,816 INFO L87 Difference]: Start difference. First operand 342 states and 538 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:32,856 INFO L93 Difference]: Finished difference Result 851 states and 1335 transitions. [2025-03-03 20:43:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:43:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 263 [2025-03-03 20:43:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:32,859 INFO L225 Difference]: With dead ends: 851 [2025-03-03 20:43:32,859 INFO L226 Difference]: Without dead ends: 512 [2025-03-03 20:43:32,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:32,860 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 167 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:32,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 400 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:43:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-03 20:43:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 427. [2025-03-03 20:43:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 385 states have (on average 1.5402597402597402) internal successors, (593), 385 states have internal predecessors, (593), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 673 transitions. [2025-03-03 20:43:32,881 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 673 transitions. Word has length 263 [2025-03-03 20:43:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:32,882 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 673 transitions. [2025-03-03 20:43:32,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 673 transitions. [2025-03-03 20:43:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:43:32,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:32,883 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:32,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:43:32,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:32,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:32,885 INFO L85 PathProgramCache]: Analyzing trace with hash 60912383, now seen corresponding path program 1 times [2025-03-03 20:43:32,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:32,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809799981] [2025-03-03 20:43:32,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:32,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:32,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:43:32,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:43:32,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:32,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:32,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809799981] [2025-03-03 20:43:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809799981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:32,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:32,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:43:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539608780] [2025-03-03 20:43:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:32,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:43:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:32,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:43:32,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:32,980 INFO L87 Difference]: Start difference. First operand 427 states and 673 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:33,026 INFO L93 Difference]: Finished difference Result 937 states and 1470 transitions. [2025-03-03 20:43:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:43:33,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 263 [2025-03-03 20:43:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:33,029 INFO L225 Difference]: With dead ends: 937 [2025-03-03 20:43:33,029 INFO L226 Difference]: Without dead ends: 513 [2025-03-03 20:43:33,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:33,031 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 153 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 508 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 [2025-03-03 20:43:33,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 508 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:43:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-03 20:43:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 378. [2025-03-03 20:43:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 336 states have (on average 1.5178571428571428) internal successors, (510), 336 states have internal predecessors, (510), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 590 transitions. [2025-03-03 20:43:33,047 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 590 transitions. Word has length 263 [2025-03-03 20:43:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:33,048 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 590 transitions. [2025-03-03 20:43:33,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 590 transitions. [2025-03-03 20:43:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 20:43:33,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:33,049 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:33,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:43:33,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:33,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1798115236, now seen corresponding path program 1 times [2025-03-03 20:43:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:33,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880440509] [2025-03-03 20:43:33,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:33,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 20:43:33,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 20:43:33,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:33,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:33,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880440509] [2025-03-03 20:43:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880440509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:33,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:33,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:43:33,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699311703] [2025-03-03 20:43:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:33,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:43:33,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:33,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:43:33,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:33,141 INFO L87 Difference]: Start difference. First operand 378 states and 590 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:33,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:33,186 INFO L93 Difference]: Finished difference Result 837 states and 1301 transitions. [2025-03-03 20:43:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:43:33,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 263 [2025-03-03 20:43:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:33,189 INFO L225 Difference]: With dead ends: 837 [2025-03-03 20:43:33,189 INFO L226 Difference]: Without dead ends: 462 [2025-03-03 20:43:33,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:33,191 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 160 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:33,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 349 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:43:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-03 20:43:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 378. [2025-03-03 20:43:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 336 states have (on average 1.5148809523809523) internal successors, (509), 336 states have internal predecessors, (509), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 589 transitions. [2025-03-03 20:43:33,206 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 589 transitions. Word has length 263 [2025-03-03 20:43:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:33,206 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 589 transitions. [2025-03-03 20:43:33,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 589 transitions. [2025-03-03 20:43:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:43:33,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:33,208 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:33,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:43:33,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:33,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash 194697907, now seen corresponding path program 1 times [2025-03-03 20:43:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:33,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427321516] [2025-03-03 20:43:33,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:33,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:33,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:43:33,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:43:33,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:33,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:33,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:33,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427321516] [2025-03-03 20:43:33,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427321516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:33,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:33,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:43:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118051772] [2025-03-03 20:43:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:33,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:43:33,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:33,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:43:33,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:43:33,569 INFO L87 Difference]: Start difference. First operand 378 states and 589 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:33,739 INFO L93 Difference]: Finished difference Result 903 states and 1405 transitions. [2025-03-03 20:43:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:43:33,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 264 [2025-03-03 20:43:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:33,742 INFO L225 Difference]: With dead ends: 903 [2025-03-03 20:43:33,742 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 20:43:33,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:43:33,743 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 152 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:33,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1341 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:43:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 20:43:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 336. [2025-03-03 20:43:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 294 states have (on average 1.4863945578231292) internal successors, (437), 294 states have internal predecessors, (437), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 517 transitions. [2025-03-03 20:43:33,753 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 517 transitions. Word has length 264 [2025-03-03 20:43:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:33,754 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 517 transitions. [2025-03-03 20:43:33,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 517 transitions. [2025-03-03 20:43:33,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:43:33,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:33,755 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:33,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:43:33,756 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:33,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 369020916, now seen corresponding path program 1 times [2025-03-03 20:43:33,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:33,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364754516] [2025-03-03 20:43:33,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:33,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:33,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:43:33,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:43:33,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:33,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:34,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364754516] [2025-03-03 20:43:34,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364754516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:34,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:34,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:43:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479312183] [2025-03-03 20:43:34,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:34,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:43:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:34,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:43:34,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:43:34,490 INFO L87 Difference]: Start difference. First operand 336 states and 517 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:34,762 INFO L93 Difference]: Finished difference Result 1034 states and 1580 transitions. [2025-03-03 20:43:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:43:34,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 264 [2025-03-03 20:43:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:34,766 INFO L225 Difference]: With dead ends: 1034 [2025-03-03 20:43:34,766 INFO L226 Difference]: Without dead ends: 701 [2025-03-03 20:43:34,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:43:34,769 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 179 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:34,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1124 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:43:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-03 20:43:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 611. [2025-03-03 20:43:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 566 states have (on average 1.510600706713781) internal successors, (855), 567 states have internal predecessors, (855), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 20:43:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 939 transitions. [2025-03-03 20:43:34,790 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 939 transitions. Word has length 264 [2025-03-03 20:43:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:34,791 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 939 transitions. [2025-03-03 20:43:34,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 939 transitions. [2025-03-03 20:43:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:43:34,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:34,793 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:34,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:43:34,794 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1153331387, now seen corresponding path program 1 times [2025-03-03 20:43:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789270099] [2025-03-03 20:43:34,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:34,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:43:34,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:43:34,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:34,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:34,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:34,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789270099] [2025-03-03 20:43:34,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789270099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:34,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:34,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:43:34,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460544558] [2025-03-03 20:43:34,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:34,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:43:34,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:34,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:43:34,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:34,855 INFO L87 Difference]: Start difference. First operand 611 states and 939 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:34,899 INFO L93 Difference]: Finished difference Result 1329 states and 2031 transitions. [2025-03-03 20:43:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:43:34,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 264 [2025-03-03 20:43:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:34,904 INFO L225 Difference]: With dead ends: 1329 [2025-03-03 20:43:34,904 INFO L226 Difference]: Without dead ends: 721 [2025-03-03 20:43:34,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:43:34,906 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 157 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:34,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 481 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:43:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-03-03 20:43:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 503. [2025-03-03 20:43:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 458 states have (on average 1.482532751091703) internal successors, (679), 459 states have internal predecessors, (679), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 20:43:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 763 transitions. [2025-03-03 20:43:34,925 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 763 transitions. Word has length 264 [2025-03-03 20:43:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:34,925 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 763 transitions. [2025-03-03 20:43:34,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 763 transitions. [2025-03-03 20:43:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:43:34,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:34,927 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:34,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:43:34,927 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:34,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1070393973, now seen corresponding path program 1 times [2025-03-03 20:43:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51899764] [2025-03-03 20:43:34,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:34,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:34,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:43:34,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:43:34,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:34,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:35,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:35,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51899764] [2025-03-03 20:43:35,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51899764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:35,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:43:35,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407122521] [2025-03-03 20:43:35,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:35,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:43:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:35,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:43:35,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:43:35,107 INFO L87 Difference]: Start difference. First operand 503 states and 763 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:35,273 INFO L93 Difference]: Finished difference Result 1037 states and 1565 transitions. [2025-03-03 20:43:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:43:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 264 [2025-03-03 20:43:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:35,276 INFO L225 Difference]: With dead ends: 1037 [2025-03-03 20:43:35,276 INFO L226 Difference]: Without dead ends: 537 [2025-03-03 20:43:35,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:43:35,277 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 417 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:35,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 373 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:43:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-03 20:43:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 425. [2025-03-03 20:43:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 380 states have (on average 1.4552631578947368) internal successors, (553), 381 states have internal predecessors, (553), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 20:43:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 637 transitions. [2025-03-03 20:43:35,296 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 637 transitions. Word has length 264 [2025-03-03 20:43:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:35,297 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 637 transitions. [2025-03-03 20:43:35,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 637 transitions. [2025-03-03 20:43:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:43:35,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:35,298 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:35,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 20:43:35,299 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:35,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash 623757461, now seen corresponding path program 1 times [2025-03-03 20:43:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:35,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619536830] [2025-03-03 20:43:35,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:35,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:43:35,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:43:35,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:35,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:36,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:36,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619536830] [2025-03-03 20:43:36,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619536830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:36,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:36,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:43:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392973267] [2025-03-03 20:43:36,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:36,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:43:36,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:36,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:43:36,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:43:36,167 INFO L87 Difference]: Start difference. First operand 425 states and 637 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:36,456 INFO L93 Difference]: Finished difference Result 866 states and 1290 transitions. [2025-03-03 20:43:36,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:43:36,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 264 [2025-03-03 20:43:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:36,459 INFO L225 Difference]: With dead ends: 866 [2025-03-03 20:43:36,459 INFO L226 Difference]: Without dead ends: 444 [2025-03-03 20:43:36,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:43:36,461 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 381 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:36,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 542 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:43:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-03 20:43:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 417. [2025-03-03 20:43:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 372 states have (on average 1.456989247311828) internal successors, (542), 373 states have internal predecessors, (542), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 20:43:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 626 transitions. [2025-03-03 20:43:36,476 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 626 transitions. Word has length 264 [2025-03-03 20:43:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:36,477 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 626 transitions. [2025-03-03 20:43:36,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 626 transitions. [2025-03-03 20:43:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:43:36,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:36,478 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:36,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 20:43:36,479 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:36,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:36,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1493782213, now seen corresponding path program 1 times [2025-03-03 20:43:36,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:36,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127845122] [2025-03-03 20:43:36,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:36,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:36,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:43:36,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:43:36,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:36,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:36,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:36,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127845122] [2025-03-03 20:43:36,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127845122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:36,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:36,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:43:36,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299717529] [2025-03-03 20:43:36,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:36,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:43:36,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:36,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:43:36,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:43:36,801 INFO L87 Difference]: Start difference. First operand 417 states and 626 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:37,022 INFO L93 Difference]: Finished difference Result 1072 states and 1615 transitions. [2025-03-03 20:43:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:43:37,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 264 [2025-03-03 20:43:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:37,026 INFO L225 Difference]: With dead ends: 1072 [2025-03-03 20:43:37,026 INFO L226 Difference]: Without dead ends: 658 [2025-03-03 20:43:37,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:43:37,028 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 135 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:37,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 629 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:43:37,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-03 20:43:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 489. [2025-03-03 20:43:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 403 states have (on average 1.4218362282878412) internal successors, (573), 404 states have internal predecessors, (573), 82 states have call successors, (82), 3 states have call predecessors, (82), 3 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 20:43:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 737 transitions. [2025-03-03 20:43:37,055 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 737 transitions. Word has length 264 [2025-03-03 20:43:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:37,055 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 737 transitions. [2025-03-03 20:43:37,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 737 transitions. [2025-03-03 20:43:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:43:37,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:37,057 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:37,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 20:43:37,058 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:37,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:37,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1394512915, now seen corresponding path program 1 times [2025-03-03 20:43:37,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:37,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733169248] [2025-03-03 20:43:37,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:37,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:43:37,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:43:37,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:37,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:37,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:37,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733169248] [2025-03-03 20:43:37,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733169248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:37,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:37,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:43:37,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054064179] [2025-03-03 20:43:37,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:37,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:43:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:37,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:43:37,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:43:37,216 INFO L87 Difference]: Start difference. First operand 489 states and 737 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:37,307 INFO L93 Difference]: Finished difference Result 1143 states and 1725 transitions. [2025-03-03 20:43:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:43:37,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 264 [2025-03-03 20:43:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:37,311 INFO L225 Difference]: With dead ends: 1143 [2025-03-03 20:43:37,311 INFO L226 Difference]: Without dead ends: 729 [2025-03-03 20:43:37,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:43:37,312 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 122 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:37,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 701 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:43:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-03 20:43:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2025-03-03 20:43:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 600 states have (on average 1.425) internal successors, (855), 601 states have internal predecessors, (855), 122 states have call successors, (122), 4 states have call predecessors, (122), 4 states have return successors, (122), 121 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-03 20:43:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1099 transitions. [2025-03-03 20:43:37,354 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1099 transitions. Word has length 264 [2025-03-03 20:43:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:37,354 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1099 transitions. [2025-03-03 20:43:37,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1099 transitions. [2025-03-03 20:43:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 20:43:37,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:37,356 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:37,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 20:43:37,356 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:37,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:37,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1649249460, now seen corresponding path program 1 times [2025-03-03 20:43:37,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:37,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382313124] [2025-03-03 20:43:37,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:37,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:37,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:43:37,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:43:37,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:37,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:43:37,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:43:37,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 20:43:37,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 20:43:37,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:37,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:43:37,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:43:37,621 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:43:37,621 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:43:37,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 20:43:37,625 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:37,756 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:43:37,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:43:37 BoogieIcfgContainer [2025-03-03 20:43:37,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:43:37,760 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:43:37,760 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:43:37,760 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:43:37,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:43:25" (3/4) ... [2025-03-03 20:43:37,762 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:43:37,763 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:43:37,763 INFO L158 Benchmark]: Toolchain (without parser) took 13609.98ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 112.6MB in the beginning and 324.9MB in the end (delta: -212.2MB). Peak memory consumption was 218.7MB. Max. memory is 16.1GB. [2025-03-03 20:43:37,763 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:43:37,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.54ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 95.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:43:37,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.83ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 91.4MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:43:37,764 INFO L158 Benchmark]: Boogie Preprocessor took 58.98ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 85.8MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:43:37,765 INFO L158 Benchmark]: IcfgBuilder took 529.85ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 52.4MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 20:43:37,765 INFO L158 Benchmark]: TraceAbstraction took 12721.30ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 51.4MB in the beginning and 325.0MB in the end (delta: -273.6MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. [2025-03-03 20:43:37,766 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 570.4MB. Free memory was 325.0MB in the beginning and 324.9MB in the end (delta: 117.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:43:37,767 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.23ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.54ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 95.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.83ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 91.4MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.98ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 85.8MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 529.85ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 52.4MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12721.30ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 51.4MB in the beginning and 325.0MB in the end (delta: -273.6MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 570.4MB. Free memory was 325.0MB in the beginning and 324.9MB in the end (delta: 117.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: 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 someBinaryFLOATComparisonOperation at line 222, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 222, overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 171, overapproximation of someBinaryDOUBLEComparisonOperation at line 197, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 199. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] unsigned long int var_1_34 = 128; [L45] unsigned long int var_1_35 = 50; [L46] unsigned long int var_1_36 = 16; [L47] unsigned long int var_1_37 = 4; [L48] unsigned char var_1_38 = 8; [L49] unsigned char var_1_39 = 10; [L50] double var_1_40 = 8.35; [L51] double var_1_41 = 63.75; [L52] double var_1_42 = -0.125; [L53] double var_1_43 = -0.8; [L54] double var_1_44 = -0.5; [L55] unsigned short int var_1_45 = 50; [L56] unsigned char var_1_46 = 0; [L57] unsigned char var_1_47 = 5; [L58] unsigned char var_1_48 = 1; [L59] signed char var_1_49 = -16; [L60] signed char var_1_50 = 2; [L61] signed char var_1_51 = 16; [L62] signed char var_1_52 = 0; [L63] signed long int var_1_53 = 256; [L64] double var_1_54 = 1.25; [L65] unsigned long int var_1_55 = 5; [L66] signed long int last_1_var_1_1 = 64; [L67] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L226] isInitial = 1 [L227] FCALL initially() [L228] COND TRUE 1 [L229] CALL updateLastVariables() [L218] last_1_var_1_1 = var_1_1 [L219] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L229] RET updateLastVariables() [L230] CALL updateVariables() [L151] var_1_7 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L152] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L153] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] var_1_15 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] var_1_16 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] var_1_18 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] var_1_19 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] var_1_21 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] var_1_22 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] var_1_23 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] var_1_27 = __VERIFIER_nondet_char() [L173] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] var_1_28 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L178] var_1_34 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] CALL assume_abort_if_not(var_1_34 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] RET assume_abort_if_not(var_1_34 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L181] var_1_35 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L182] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] CALL assume_abort_if_not(var_1_35 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] RET assume_abort_if_not(var_1_35 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L184] var_1_36 = __VERIFIER_nondet_ulong() [L185] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L185] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] CALL assume_abort_if_not(var_1_36 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] RET assume_abort_if_not(var_1_36 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L187] var_1_37 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L188] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_37 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET assume_abort_if_not(var_1_37 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] var_1_38 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L191] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] var_1_39 = __VERIFIER_nondet_uchar() [L194] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L194] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] CALL assume_abort_if_not(var_1_39 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] RET assume_abort_if_not(var_1_39 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] var_1_41 = __VERIFIER_nondet_double() [L197] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L197] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L198] var_1_42 = __VERIFIER_nondet_double() [L199] CALL assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] RET assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L200] var_1_43 = __VERIFIER_nondet_double() [L201] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L201] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L202] var_1_44 = __VERIFIER_nondet_double() [L203] CALL assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L203] RET assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L204] var_1_47 = __VERIFIER_nondet_uchar() [L205] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L205] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L206] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L206] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L207] var_1_50 = __VERIFIER_nondet_char() [L208] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L208] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L209] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L209] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L210] var_1_51 = __VERIFIER_nondet_char() [L211] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L211] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L212] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L212] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L213] var_1_52 = __VERIFIER_nondet_char() [L214] CALL assume_abort_if_not(var_1_52 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L214] RET assume_abort_if_not(var_1_52 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L215] CALL assume_abort_if_not(var_1_52 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L215] RET assume_abort_if_not(var_1_52 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L230] RET updateVariables() [L231] CALL step() [L71] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L72] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L75] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L76] COND FALSE !(\read(var_1_7)) [L79] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=64, var_1_22=4294967302, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L81] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=64, var_1_22=4294967302, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L84] var_1_32 = var_1_16 [L85] var_1_30 = var_1_32 [L86] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=64, var_1_22=4294967302, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L87] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=64, var_1_22=4294967302, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L87] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L88] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=64, var_1_22=4294967302, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L90] COND TRUE var_1_11 >= var_1_30 [L91] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=64, var_1_22=4294967302, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L93] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=64, var_1_22=4294967302, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L93] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L94] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L102] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L103] COND TRUE ! var_1_7 [L104] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L112] EXPR var_1_34 ^ var_1_35 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=4294967296, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L112] EXPR var_1_36 | var_1_37 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L112] COND TRUE (var_1_34 ^ var_1_35) < (var_1_36 | var_1_37) [L113] var_1_33 = ((((var_1_38) > (var_1_39)) ? (var_1_38) : (var_1_39))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L117] COND TRUE (-32 & var_1_38) > var_1_35 [L118] var_1_40 = ((((var_1_41) > (var_1_42)) ? (var_1_41) : (var_1_42))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L122] COND TRUE var_1_44 >= ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L123] COND FALSE !(var_1_36 > var_1_34) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L133] COND FALSE !(var_1_44 > (var_1_43 + var_1_41)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L140] var_1_48 = var_1_39 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=6, var_1_49=-16, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L141] COND TRUE var_1_41 < var_1_40 [L142] var_1_49 = ((var_1_50 - var_1_51) + var_1_52) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=6, var_1_49=5, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L146] var_1_53 = var_1_33 [L147] var_1_54 = var_1_44 [L148] var_1_55 = var_1_46 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_44=4294967301, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=6, var_1_49=5, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=254, var_1_54=4294967301, var_1_55=0, var_1_7=0] [L231] RET step() [L232] CALL, EXPR property() [L222] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_44=4294967301, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=6, var_1_49=5, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=254, var_1_54=4294967301, var_1_55=0, var_1_7=0] [L222] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_44=4294967301, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=6, var_1_49=5, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=254, var_1_54=4294967301, var_1_55=0, var_1_7=0] [L222] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_44=4294967301, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=6, var_1_49=5, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=254, var_1_54=4294967301, var_1_55=0, var_1_7=0] [L222] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_44=4294967301, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=6, var_1_49=5, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=254, var_1_54=4294967301, var_1_55=0, var_1_7=0] [L222-L223] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L232] RET, EXPR property() [L232] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_44=4294967301, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=6, var_1_49=5, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=254, var_1_54=4294967301, var_1_55=0, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=4294967302, var_1_1=-252, var_1_22=4294967302, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_34=0, var_1_35=4294967296, var_1_36=-4294967296, var_1_37=4, var_1_38=254, var_1_39=6, var_1_40=4294967303, var_1_41=4294967303, var_1_42=4294967303, var_1_44=4294967301, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=6, var_1_49=5, var_1_50=5, var_1_51=63, var_1_52=63, var_1_53=254, var_1_54=4294967301, var_1_55=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 20, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3826 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3826 mSDsluCounter, 16361 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11306 mSDsCounter, 502 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3680 IncrementalHoareTripleChecker+Invalid, 4182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 502 mSolverCounterUnsat, 5055 mSDtfsCounter, 3680 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=727occurred in iteration=19, InterpolantAutomatonStates: 100, 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, 2241 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 5515 NumberOfCodeBlocks, 5515 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5231 ConstructedInterpolants, 0 QuantifiedInterpolants, 11266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 62322/62400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 20:43:37,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 01076893d0875072ea1a0a9ca67dbc9f3276dc5a34f6337d5335f830cd00f921 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:43:39,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:43:39,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:43:39,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:43:39,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:43:39,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:43:39,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:43:39,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:43:39,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:43:39,721 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:43:39,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:43:39,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:43:39,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:43:39,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:43:39,722 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:43:39,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:43:39,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:43:39,722 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:43:39,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:43:39,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:43:39,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:43:39,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:43:39,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:43:39,723 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:43:39,723 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:43:39,723 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:43:39,723 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:43:39,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:43:39,723 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:43:39,723 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:43:39,723 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:43:39,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:43:39,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:43:39,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:43:39,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:43:39,724 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01076893d0875072ea1a0a9ca67dbc9f3276dc5a34f6337d5335f830cd00f921 [2025-03-03 20:43:39,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:43:39,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:43:39,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:43:39,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:43:39,965 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:43:39,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i [2025-03-03 20:43:41,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ba42096/5088a5e6721b468e9749512171d21deb/FLAG34748c637 [2025-03-03 20:43:41,341 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:43:41,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i [2025-03-03 20:43:41,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ba42096/5088a5e6721b468e9749512171d21deb/FLAG34748c637 [2025-03-03 20:43:41,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ba42096/5088a5e6721b468e9749512171d21deb [2025-03-03 20:43:41,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:43:41,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:43:41,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:43:41,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:43:41,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:43:41,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476b5a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41, skipping insertion in model container [2025-03-03 20:43:41,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:43:41,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i[919,932] [2025-03-03 20:43:41,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:43:41,597 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:43:41,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i[919,932] [2025-03-03 20:43:41,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:43:41,677 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:43:41,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41 WrapperNode [2025-03-03 20:43:41,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:43:41,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:43:41,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:43:41,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:43:41,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,726 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2025-03-03 20:43:41,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:43:41,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:43:41,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:43:41,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:43:41,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,758 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:43:41,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:43:41,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:43:41,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:43:41,787 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:43:41,788 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (1/1) ... [2025-03-03 20:43:41,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:43:41,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:43:41,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:43:41,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:43:41,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:43:41,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:43:41,837 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:43:41,837 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:43:41,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:43:41,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:43:41,930 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:43:41,932 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:43:48,699 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 20:43:48,699 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:43:48,709 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:43:48,709 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:43:48,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:43:48 BoogieIcfgContainer [2025-03-03 20:43:48,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:43:48,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:43:48,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:43:48,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:43:48,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:43:41" (1/3) ... [2025-03-03 20:43:48,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3b1082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:43:48, skipping insertion in model container [2025-03-03 20:43:48,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:41" (2/3) ... [2025-03-03 20:43:48,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3b1082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:43:48, skipping insertion in model container [2025-03-03 20:43:48,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:43:48" (3/3) ... [2025-03-03 20:43:48,716 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i [2025-03-03 20:43:48,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:43:48,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-63.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:43:48,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:43:48,782 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;@488bbbb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:43:48,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:43:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 64 states have internal predecessors, (85), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-03 20:43:48,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:48,797 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:48,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:48,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash -680695631, now seen corresponding path program 1 times [2025-03-03 20:43:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:43:48,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206875266] [2025-03-03 20:43:48,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:48,810 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 [2025-03-03 20:43:48,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:43:48,812 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) [2025-03-03 20:43:48,813 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 [2025-03-03 20:43:48,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-03 20:43:49,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-03 20:43:49,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:49,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:49,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:43:49,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:43:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1310 proven. 0 refuted. 0 times theorem prover too weak. 1810 trivial. 0 not checked. [2025-03-03 20:43:49,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:43:49,344 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:43:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206875266] [2025-03-03 20:43:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206875266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:49,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:49,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:43:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771678648] [2025-03-03 20:43:49,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:49,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:43:49,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:43:49,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:43:49,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:43:49,366 INFO L87 Difference]: Start difference. First operand has 106 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 64 states have internal predecessors, (85), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 20:43:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:49,393 INFO L93 Difference]: Finished difference Result 206 states and 365 transitions. [2025-03-03 20:43:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:43:49,394 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 252 [2025-03-03 20:43:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:49,399 INFO L225 Difference]: With dead ends: 206 [2025-03-03 20:43:49,399 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 20:43:49,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:43:49,402 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:49,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:43:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 20:43:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-03 20:43:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:43:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 160 transitions. [2025-03-03 20:43:49,433 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 160 transitions. Word has length 252 [2025-03-03 20:43:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:49,434 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 160 transitions. [2025-03-03 20:43:49,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-03 20:43:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 160 transitions. [2025-03-03 20:43:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-03 20:43:49,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:49,438 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:49,453 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 [2025-03-03 20:43:49,639 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 [2025-03-03 20:43:49,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:49,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash -798794233, now seen corresponding path program 1 times [2025-03-03 20:43:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:43:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045465439] [2025-03-03 20:43:49,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:49,641 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 [2025-03-03 20:43:49,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:43:49,643 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) [2025-03-03 20:43:49,644 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 [2025-03-03 20:43:49,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-03 20:43:50,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-03 20:43:50,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:50,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:50,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:43:50,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:43:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:43:53,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:43:53,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:43:53,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045465439] [2025-03-03 20:43:53,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045465439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:53,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:53,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:43:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52210265] [2025-03-03 20:43:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:53,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:43:53,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:43:53,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:43:53,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:43:53,275 INFO L87 Difference]: Start difference. First operand 103 states and 160 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:43:56,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:44:00,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:44:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:44:00,245 INFO L93 Difference]: Finished difference Result 304 states and 475 transitions. [2025-03-03 20:44:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:44:00,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 252 [2025-03-03 20:44:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:44:00,273 INFO L225 Difference]: With dead ends: 304 [2025-03-03 20:44:00,273 INFO L226 Difference]: Without dead ends: 204 [2025-03-03 20:44:00,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:44:00,274 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 91 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:44:00,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 524 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-03-03 20:44:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-03 20:44:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 175. [2025-03-03 20:44:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 92 states have internal predecessors, (111), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 20:44:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 271 transitions. [2025-03-03 20:44:00,311 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 271 transitions. Word has length 252 [2025-03-03 20:44:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:44:00,311 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 271 transitions. [2025-03-03 20:44:00,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:44:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 271 transitions. [2025-03-03 20:44:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-03 20:44:00,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:44:00,318 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:44:00,335 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 [2025-03-03 20:44:00,518 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 [2025-03-03 20:44:00,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:44:00,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:44:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1458116774, now seen corresponding path program 1 times [2025-03-03 20:44:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:44:00,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922862640] [2025-03-03 20:44:00,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:00,520 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 [2025-03-03 20:44:00,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:44:00,522 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) [2025-03-03 20:44:00,523 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 [2025-03-03 20:44:00,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-03 20:44:00,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-03 20:44:00,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:00,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:00,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:44:00,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:44:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-03 20:44:00,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:44:00,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:44:00,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922862640] [2025-03-03 20:44:00,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922862640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:44:00,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:44:00,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:44:00,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004156141] [2025-03-03 20:44:00,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:44:00,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:44:00,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:44:00,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:44:00,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:44:00,996 INFO L87 Difference]: Start difference. First operand 175 states and 271 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:44:04,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:44:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:44:04,786 INFO L93 Difference]: Finished difference Result 302 states and 470 transitions. [2025-03-03 20:44:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:44:04,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 252 [2025-03-03 20:44:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:44:04,789 INFO L225 Difference]: With dead ends: 302 [2025-03-03 20:44:04,789 INFO L226 Difference]: Without dead ends: 202 [2025-03-03 20:44:04,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:44:04,791 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 34 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:44:04,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 329 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-03 20:44:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-03 20:44:04,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 183. [2025-03-03 20:44:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 100 states have (on average 1.22) internal successors, (122), 100 states have internal predecessors, (122), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 20:44:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 282 transitions. [2025-03-03 20:44:04,808 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 282 transitions. Word has length 252 [2025-03-03 20:44:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:44:04,808 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 282 transitions. [2025-03-03 20:44:04,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-03 20:44:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 282 transitions. [2025-03-03 20:44:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-03 20:44:04,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:44:04,811 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:44:04,826 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 (4)] Ended with exit code 0 [2025-03-03 20:44:05,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 [2025-03-03 20:44:05,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:44:05,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:44:05,012 INFO L85 PathProgramCache]: Analyzing trace with hash 204820678, now seen corresponding path program 1 times [2025-03-03 20:44:05,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:44:05,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305294057] [2025-03-03 20:44:05,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:05,012 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 [2025-03-03 20:44:05,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:44:05,014 INFO L229 MonitoredProcess]: Starting monitored process 5 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) [2025-03-03 20:44:05,015 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 (5)] Waiting until timeout for monitored process [2025-03-03 20:44:05,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-03 20:44:05,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-03 20:44:05,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:05,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:05,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 20:44:05,417 INFO L279 TraceCheckSpWp]: Computing forward predicates...