./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-74.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 bc7705536f6a2fe085848cbac99c48575b3f22e7b27f06b68603e0d3dd224d5d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:49:58,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:49:58,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:49:58,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:49:58,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:49:58,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:49:58,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:49:58,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:49:58,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:49:58,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:49:58,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:49:58,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:49:58,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:49:58,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:49:58,475 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:49:58,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:49:58,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:49:58,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:49:58,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:49:58,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:49:58,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:49:58,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:49:58,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:49:58,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:49:58,478 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:49:58,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:49:58,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:49:58,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:49:58,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:49:58,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:49:58,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:49:58,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:49:58,478 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 -> bc7705536f6a2fe085848cbac99c48575b3f22e7b27f06b68603e0d3dd224d5d [2025-03-17 01:49:58,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:49:58,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:49:58,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:49:58,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:49:58,712 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:49:58,714 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-pr-co_file-74.i [2025-03-17 01:49:59,803 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcdf2067d/0cb64afd660a418a8ed462f4732916e5/FLAGe83a8d441 [2025-03-17 01:50:00,027 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:50:00,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-74.i [2025-03-17 01:50:00,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcdf2067d/0cb64afd660a418a8ed462f4732916e5/FLAGe83a8d441 [2025-03-17 01:50:00,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcdf2067d/0cb64afd660a418a8ed462f4732916e5 [2025-03-17 01:50:00,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:50:00,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:50:00,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:50:00,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:50:00,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:50:00,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cdb6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00, skipping insertion in model container [2025-03-17 01:50:00,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:50:00,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-pr-co_file-74.i[919,932] [2025-03-17 01:50:00,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:50:00,598 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:50:00,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-pr-co_file-74.i[919,932] [2025-03-17 01:50:00,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:50:00,667 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:50:00,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00 WrapperNode [2025-03-17 01:50:00,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:50:00,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:50:00,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:50:00,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:50:00,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,723 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2025-03-17 01:50:00,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:50:00,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:50:00,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:50:00,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:50:00,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,757 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-17 01:50:00,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:50:00,771 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:50:00,771 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:50:00,771 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:50:00,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (1/1) ... [2025-03-17 01:50:00,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:50:00,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:50:00,801 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-17 01:50:00,803 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-17 01:50:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:50:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:50:00,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:50:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:50:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:50:00,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:50:00,876 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:50:00,878 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:50:01,185 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc property_#t~ite25#1;havoc property_#t~bitwise24#1;havoc property_#t~short26#1; [2025-03-17 01:50:01,210 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 01:50:01,210 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:50:01,223 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:50:01,223 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 01:50:01,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:50:01 BoogieIcfgContainer [2025-03-17 01:50:01,223 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:50:01,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:50:01,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:50:01,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:50:01,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:50:00" (1/3) ... [2025-03-17 01:50:01,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34de3f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:50:01, skipping insertion in model container [2025-03-17 01:50:01,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:00" (2/3) ... [2025-03-17 01:50:01,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34de3f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:50:01, skipping insertion in model container [2025-03-17 01:50:01,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:50:01" (3/3) ... [2025-03-17 01:50:01,231 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-74.i [2025-03-17 01:50:01,241 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:50:01,242 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-74.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:50:01,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:50:01,286 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;@4ebd1302, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:50:01,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:50:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 01:50:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 01:50:01,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:01,302 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:01,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:01,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:01,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1391654036, now seen corresponding path program 1 times [2025-03-17 01:50:01,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438061257] [2025-03-17 01:50:01,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:01,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:01,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 01:50:01,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 01:50:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:01,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-17 01:50:01,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:01,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438061257] [2025-03-17 01:50:01,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438061257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:50:01,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523556951] [2025-03-17 01:50:01,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:01,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:50:01,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:50:01,610 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-17 01:50:01,612 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-17 01:50:01,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 01:50:01,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 01:50:01,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:01,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:01,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:50:01,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:50:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-17 01:50:01,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:50:01,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523556951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:01,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:50:01,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:50:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394224672] [2025-03-17 01:50:01,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:01,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:50:01,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:01,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:50:01,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:50:01,780 INFO L87 Difference]: Start difference. First operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 01:50:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:01,802 INFO L93 Difference]: Finished difference Result 192 states and 331 transitions. [2025-03-17 01:50:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:50:01,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 168 [2025-03-17 01:50:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:01,809 INFO L225 Difference]: With dead ends: 192 [2025-03-17 01:50:01,810 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 01:50:01,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-17 01:50:01,816 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:01,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:50:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 01:50:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 01:50:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 01:50:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 144 transitions. [2025-03-17 01:50:01,858 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 144 transitions. Word has length 168 [2025-03-17 01:50:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:01,858 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 144 transitions. [2025-03-17 01:50:01,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 01:50:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 144 transitions. [2025-03-17 01:50:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 01:50:01,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:01,863 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:01,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:50:02,063 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-17 01:50:02,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:02,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:02,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1656019121, now seen corresponding path program 1 times [2025-03-17 01:50:02,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:02,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658392852] [2025-03-17 01:50:02,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:02,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 01:50:02,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 01:50:02,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:02,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 01:50:02,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658392852] [2025-03-17 01:50:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658392852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:02,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:50:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999897372] [2025-03-17 01:50:02,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:02,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:50:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:02,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:50:02,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:50:02,283 INFO L87 Difference]: Start difference. First operand 95 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:02,346 INFO L93 Difference]: Finished difference Result 224 states and 334 transitions. [2025-03-17 01:50:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:50:02,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-17 01:50:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:02,349 INFO L225 Difference]: With dead ends: 224 [2025-03-17 01:50:02,351 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 01:50:02,352 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-17 01:50:02,353 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 44 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:02,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 267 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:50:02,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 01:50:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2025-03-17 01:50:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 92 states have internal predecessors, (122), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 01:50:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 188 transitions. [2025-03-17 01:50:02,373 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 188 transitions. Word has length 168 [2025-03-17 01:50:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:02,373 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 188 transitions. [2025-03-17 01:50:02,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 188 transitions. [2025-03-17 01:50:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 01:50:02,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:02,375 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:02,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:50:02,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:02,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1459505616, now seen corresponding path program 1 times [2025-03-17 01:50:02,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:02,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175357285] [2025-03-17 01:50:02,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:02,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:02,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 01:50:02,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 01:50:02,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:02,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 01:50:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:02,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175357285] [2025-03-17 01:50:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175357285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:02,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:50:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832891917] [2025-03-17 01:50:02,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:02,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:50:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:02,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:50:02,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:50:02,732 INFO L87 Difference]: Start difference. First operand 127 states and 188 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:02,799 INFO L93 Difference]: Finished difference Result 331 states and 494 transitions. [2025-03-17 01:50:02,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:50:02,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-17 01:50:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:02,805 INFO L225 Difference]: With dead ends: 331 [2025-03-17 01:50:02,806 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 01:50:02,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 01:50:02,808 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 62 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:02,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 253 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:50:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 01:50:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 198. [2025-03-17 01:50:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 135 states have (on average 1.325925925925926) internal successors, (179), 136 states have internal predecessors, (179), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 01:50:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 295 transitions. [2025-03-17 01:50:02,840 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 295 transitions. Word has length 168 [2025-03-17 01:50:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:02,841 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 295 transitions. [2025-03-17 01:50:02,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 295 transitions. [2025-03-17 01:50:02,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 01:50:02,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:02,844 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:02,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:50:02,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1296477274, now seen corresponding path program 1 times [2025-03-17 01:50:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463404614] [2025-03-17 01:50:02,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:02,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 01:50:02,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 01:50:02,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:02,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 01:50:03,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463404614] [2025-03-17 01:50:03,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463404614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:03,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:03,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:50:03,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498982925] [2025-03-17 01:50:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:03,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:50:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:03,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:50:03,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:50:03,514 INFO L87 Difference]: Start difference. First operand 198 states and 295 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:03,834 INFO L93 Difference]: Finished difference Result 388 states and 571 transitions. [2025-03-17 01:50:03,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:50:03,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-17 01:50:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:03,836 INFO L225 Difference]: With dead ends: 388 [2025-03-17 01:50:03,838 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 01:50:03,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-17 01:50:03,840 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 115 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:03,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 445 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:50:03,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 01:50:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2025-03-17 01:50:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 136 states have internal predecessors, (178), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 01:50:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 294 transitions. [2025-03-17 01:50:03,874 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 294 transitions. Word has length 170 [2025-03-17 01:50:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:03,875 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 294 transitions. [2025-03-17 01:50:03,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 294 transitions. [2025-03-17 01:50:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 01:50:03,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:03,877 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:03,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:50:03,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash 786202863, now seen corresponding path program 1 times [2025-03-17 01:50:03,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:03,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868793486] [2025-03-17 01:50:03,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:03,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:03,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 01:50:03,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 01:50:03,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:03,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 01:50:04,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868793486] [2025-03-17 01:50:04,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868793486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:04,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:04,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:50:04,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520439023] [2025-03-17 01:50:04,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:04,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:50:04,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:04,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:50:04,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:50:04,331 INFO L87 Difference]: Start difference. First operand 198 states and 294 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:04,659 INFO L93 Difference]: Finished difference Result 388 states and 570 transitions. [2025-03-17 01:50:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:50:04,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2025-03-17 01:50:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:04,662 INFO L225 Difference]: With dead ends: 388 [2025-03-17 01:50:04,662 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 01:50:04,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:50:04,663 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 113 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:04,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 522 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:50:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 01:50:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2025-03-17 01:50:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 135 states have (on average 1.3111111111111111) internal successors, (177), 136 states have internal predecessors, (177), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 01:50:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 293 transitions. [2025-03-17 01:50:04,691 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 293 transitions. Word has length 171 [2025-03-17 01:50:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:04,693 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 293 transitions. [2025-03-17 01:50:04,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 293 transitions. [2025-03-17 01:50:04,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 01:50:04,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:04,695 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:04,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:50:04,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:04,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:04,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1747816880, now seen corresponding path program 1 times [2025-03-17 01:50:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:04,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788780678] [2025-03-17 01:50:04,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:04,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:04,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 01:50:04,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 01:50:04,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:04,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 01:50:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788780678] [2025-03-17 01:50:05,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788780678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:05,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:05,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:50:05,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968708673] [2025-03-17 01:50:05,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:05,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:50:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:05,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:50:05,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:50:05,392 INFO L87 Difference]: Start difference. First operand 198 states and 293 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 01:50:05,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:05,852 INFO L93 Difference]: Finished difference Result 367 states and 535 transitions. [2025-03-17 01:50:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:50:05,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 171 [2025-03-17 01:50:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:05,854 INFO L225 Difference]: With dead ends: 367 [2025-03-17 01:50:05,855 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 01:50:05,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:50:05,855 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 252 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:05,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 492 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:50:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 01:50:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 196. [2025-03-17 01:50:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 134 states have internal predecessors, (170), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 01:50:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 286 transitions. [2025-03-17 01:50:05,882 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 286 transitions. Word has length 171 [2025-03-17 01:50:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:05,882 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 286 transitions. [2025-03-17 01:50:05,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 01:50:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 286 transitions. [2025-03-17 01:50:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 01:50:05,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:05,884 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:05,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:50:05,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:05,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:05,885 INFO L85 PathProgramCache]: Analyzing trace with hash -363444631, now seen corresponding path program 1 times [2025-03-17 01:50:05,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:05,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729828848] [2025-03-17 01:50:05,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:05,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:05,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 01:50:06,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 01:50:06,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:06,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 01:50:06,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:06,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729828848] [2025-03-17 01:50:06,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729828848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:50:06,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121487272] [2025-03-17 01:50:06,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:06,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:50:06,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:50:06,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:50:06,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 01:50:06,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 01:50:06,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 01:50:06,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:06,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:06,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 01:50:06,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:50:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 670 proven. 138 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 01:50:07,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:50:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 75 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-03-17 01:50:08,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121487272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:50:08,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:50:08,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 31 [2025-03-17 01:50:08,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400261623] [2025-03-17 01:50:08,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:50:08,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 01:50:08,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:08,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 01:50:08,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=680, Unknown=0, NotChecked=0, Total=930 [2025-03-17 01:50:08,044 INFO L87 Difference]: Start difference. First operand 196 states and 286 transitions. Second operand has 31 states, 30 states have (on average 4.466666666666667) internal successors, (134), 31 states have internal predecessors, (134), 8 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 7 states have call predecessors, (56), 8 states have call successors, (56) [2025-03-17 01:50:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:10,067 INFO L93 Difference]: Finished difference Result 835 states and 1147 transitions. [2025-03-17 01:50:10,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-17 01:50:10,067 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.466666666666667) internal successors, (134), 31 states have internal predecessors, (134), 8 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 7 states have call predecessors, (56), 8 states have call successors, (56) Word has length 173 [2025-03-17 01:50:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:10,071 INFO L225 Difference]: With dead ends: 835 [2025-03-17 01:50:10,071 INFO L226 Difference]: Without dead ends: 711 [2025-03-17 01:50:10,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1372, Invalid=3458, Unknown=0, NotChecked=0, Total=4830 [2025-03-17 01:50:10,073 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1199 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:10,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 832 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:50:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-17 01:50:10,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 358. [2025-03-17 01:50:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 271 states have (on average 1.2915129151291513) internal successors, (350), 274 states have internal predecessors, (350), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 01:50:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 502 transitions. [2025-03-17 01:50:10,107 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 502 transitions. Word has length 173 [2025-03-17 01:50:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:10,107 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 502 transitions. [2025-03-17 01:50:10,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.466666666666667) internal successors, (134), 31 states have internal predecessors, (134), 8 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 7 states have call predecessors, (56), 8 states have call successors, (56) [2025-03-17 01:50:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 502 transitions. [2025-03-17 01:50:10,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 01:50:10,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:10,109 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:10,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:50:10,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 01:50:10,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:10,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash -559958136, now seen corresponding path program 1 times [2025-03-17 01:50:10,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:10,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682737131] [2025-03-17 01:50:10,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:10,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:10,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 01:50:10,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 01:50:10,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:10,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:50:10,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384317997] [2025-03-17 01:50:10,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:10,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:50:10,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:50:10,405 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:50:10,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 01:50:10,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 01:50:10,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 01:50:10,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:10,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:50:10,518 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:50:10,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 01:50:10,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 01:50:10,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:10,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:50:10,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:50:10,663 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:50:10,664 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:50:10,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 01:50:10,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:50:10,871 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:50:10,969 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:50:10,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:50:10 BoogieIcfgContainer [2025-03-17 01:50:10,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:50:10,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:50:10,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:50:10,975 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:50:10,975 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:50:01" (3/4) ... [2025-03-17 01:50:10,977 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:50:10,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:50:10,978 INFO L158 Benchmark]: Toolchain (without parser) took 10598.88ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 106.5MB in the beginning and 133.2MB in the end (delta: -26.6MB). Peak memory consumption was 215.8MB. Max. memory is 16.1GB. [2025-03-17 01:50:10,978 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:50:10,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.37ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 90.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:50:10,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.11ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 85.6MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:50:10,979 INFO L158 Benchmark]: Boogie Preprocessor took 46.28ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 79.1MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:50:10,979 INFO L158 Benchmark]: IcfgBuilder took 452.20ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 47.4MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 01:50:10,979 INFO L158 Benchmark]: TraceAbstraction took 9747.22ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 47.4MB in the beginning and 133.2MB in the end (delta: -85.8MB). Peak memory consumption was 157.1MB. Max. memory is 16.1GB. [2025-03-17 01:50:10,979 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 385.9MB. Free memory was 133.2MB in the beginning and 133.2MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:50:10,980 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.37ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 90.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.11ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 85.6MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.28ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 79.1MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 452.20ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 47.4MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9747.22ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 47.4MB in the beginning and 133.2MB in the end (delta: -85.8MB). Peak memory consumption was 157.1MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 385.9MB. Free memory was 133.2MB in the beginning and 133.2MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 171, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 173, overapproximation of someBinaryFLOATComparisonOperation at line 163, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of bitwiseOr at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticFLOAToperation at line 126. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] signed char var_1_27 = 4; [L44] float var_1_28 = 3.5; [L45] signed short int var_1_29 = -8; [L46] signed char var_1_31 = -32; [L47] signed char var_1_32 = 2; [L48] signed long int var_1_34 = -4; [L49] double var_1_38 = 0.5; [L50] double var_1_39 = 255.8; [L51] unsigned long int last_1_var_1_1 = 64; [L52] unsigned char last_1_var_1_11 = 50; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L181] last_1_var_1_1 = var_1_1 [L182] last_1_var_1_11 = var_1_11 [L192] RET updateLastVariables() [L193] CALL updateVariables() [L138] var_1_4 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L141] var_1_5 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L144] var_1_7 = __VERIFIER_nondet_ulong() [L145] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L147] var_1_9 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L148] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L149] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L150] var_1_10 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L153] var_1_12 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L156] var_1_13 = __VERIFIER_nondet_long() [L157] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L159] var_1_16 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L162] var_1_17 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] var_1_19 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && 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_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && 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_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L166] var_1_20 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && 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_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && 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_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L172] var_1_23 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L173] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L174] var_1_27 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L175] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L177] var_1_39 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_39 >= -922337.2036854765600e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178] RET assume_abort_if_not((var_1_39 >= -922337.2036854765600e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L193] RET updateVariables() [L194] CALL step() [L56] signed long int stepLocal_1 = last_1_var_1_11; [L57] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L58] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L59] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L63] COND TRUE ((((var_1_1) < (var_1_27)) ? (var_1_1) : (var_1_27))) <= var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L64] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L80] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L81] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L81] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L82] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L93] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L95] COND TRUE (~ (5 + var_1_1)) >= 10000u [L96] var_1_29 = (((((var_1_1 + var_1_27)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((var_1_1 + var_1_27)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L100] EXPR var_1_1 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L100] EXPR ((var_1_27) < ((var_1_1 | -5))) ? (var_1_27) : ((var_1_1 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L100] COND FALSE !(var_1_11 <= ((((var_1_27) < ((var_1_1 | -5))) ? (var_1_27) : ((var_1_1 | -5))))) [L105] var_1_38 = var_1_39 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] COND FALSE !(! (var_1_11 >= var_1_11)) [L113] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L115] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L120] COND FALSE !((~ (var_1_1 % 200u)) < 32u) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L123] COND FALSE !(\read(var_1_10)) [L126] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L128] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L129] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L132] COND FALSE !(var_1_11 > var_1_11) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L135] var_1_31 = var_1_27 [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=13, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L185] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=13, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L185] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=13, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L185-L186] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=13, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=13, var_1_28=7/2, var_1_29=77, var_1_31=13, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 180 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1787 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1785 mSDsluCounter, 2951 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1970 mSDsCounter, 633 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2049 IncrementalHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 633 mSolverCounterUnsat, 981 mSDtfsCounter, 2049 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=7, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 498 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1876 NumberOfCodeBlocks, 1876 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1693 ConstructedInterpolants, 0 QuantifiedInterpolants, 5744 SizeOfPredicates, 8 NumberOfNonLiveVariables, 793 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 11697/12000 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-17 01:50:11,014 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-pr-co_file-74.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 bc7705536f6a2fe085848cbac99c48575b3f22e7b27f06b68603e0d3dd224d5d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:50:12,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:50:12,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:50:12,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:50:12,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:50:12,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:50:12,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:50:12,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:50:12,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:50:12,919 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:50:12,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:50:12,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:50:12,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:50:12,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:50:12,919 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:50:12,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:50:12,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:50:12,920 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:50:12,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:50:12,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:50:12,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:50:12,921 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:50:12,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:50:12,921 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:50:12,921 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:50:12,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:50:12,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:50:12,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:50:12,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:50:12,921 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 -> bc7705536f6a2fe085848cbac99c48575b3f22e7b27f06b68603e0d3dd224d5d [2025-03-17 01:50:13,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:50:13,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:50:13,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:50:13,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:50:13,178 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:50:13,179 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-pr-co_file-74.i [2025-03-17 01:50:14,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5845ec3/cb707f55c55b47d8a8524ec14980698b/FLAGe634c0b01 [2025-03-17 01:50:14,568 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:50:14,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-74.i [2025-03-17 01:50:14,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5845ec3/cb707f55c55b47d8a8524ec14980698b/FLAGe634c0b01 [2025-03-17 01:50:14,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5845ec3/cb707f55c55b47d8a8524ec14980698b [2025-03-17 01:50:14,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:50:14,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:50:14,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:50:14,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:50:14,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:50:14,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5326dd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14, skipping insertion in model container [2025-03-17 01:50:14,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:50:14,737 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-pr-co_file-74.i[919,932] [2025-03-17 01:50:14,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:50:14,823 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:50:14,831 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-pr-co_file-74.i[919,932] [2025-03-17 01:50:14,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:50:14,869 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:50:14,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14 WrapperNode [2025-03-17 01:50:14,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:50:14,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:50:14,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:50:14,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:50:14,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,900 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-03-17 01:50:14,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:50:14,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:50:14,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:50:14,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:50:14,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,923 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-17 01:50:14,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:50:14,948 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:50:14,948 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:50:14,948 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:50:14,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (1/1) ... [2025-03-17 01:50:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:50:14,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:50:14,976 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-17 01:50:14,979 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-17 01:50:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:50:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:50:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:50:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:50:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:50:14,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:50:15,073 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:50:15,075 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:50:18,190 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 01:50:18,191 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:50:18,200 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:50:18,200 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:50:18,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:50:18 BoogieIcfgContainer [2025-03-17 01:50:18,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:50:18,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:50:18,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:50:18,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:50:18,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:50:14" (1/3) ... [2025-03-17 01:50:18,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90ac809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:50:18, skipping insertion in model container [2025-03-17 01:50:18,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:14" (2/3) ... [2025-03-17 01:50:18,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90ac809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:50:18, skipping insertion in model container [2025-03-17 01:50:18,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:50:18" (3/3) ... [2025-03-17 01:50:18,209 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-74.i [2025-03-17 01:50:18,218 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:50:18,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-74.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:50:18,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:50:18,277 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;@4eed7d54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:50:18,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:50:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 01:50:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 01:50:18,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:18,292 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:18,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:18,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash -496489502, now seen corresponding path program 1 times [2025-03-17 01:50:18,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:50:18,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999526317] [2025-03-17 01:50:18,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:18,307 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-17 01:50:18,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:50:18,310 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-17 01:50:18,311 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-17 01:50:18,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 01:50:18,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 01:50:18,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:18,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:18,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:50:18,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:50:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-03-17 01:50:18,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:50:18,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:50:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999526317] [2025-03-17 01:50:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999526317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:18,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:18,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:50:18,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905675147] [2025-03-17 01:50:18,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:18,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:50:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:50:18,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:50:18,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:50:18,706 INFO L87 Difference]: Start difference. First operand has 79 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 01:50:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:18,733 INFO L93 Difference]: Finished difference Result 154 states and 275 transitions. [2025-03-17 01:50:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:50:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2025-03-17 01:50:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:18,741 INFO L225 Difference]: With dead ends: 154 [2025-03-17 01:50:18,742 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 01:50:18,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-17 01:50:18,749 INFO L435 NwaCegarLoop]: 118 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, 118 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-17 01:50:18,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:50:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 01:50:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 01:50:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 01:50:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 118 transitions. [2025-03-17 01:50:18,789 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 118 transitions. Word has length 161 [2025-03-17 01:50:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:18,789 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 118 transitions. [2025-03-17 01:50:18,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 01:50:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 118 transitions. [2025-03-17 01:50:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 01:50:18,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:18,794 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:18,807 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 (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:50:18,994 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-17 01:50:18,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:18,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash -910053531, now seen corresponding path program 1 times [2025-03-17 01:50:18,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:50:18,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793348432] [2025-03-17 01:50:18,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:18,996 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-17 01:50:18,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:50:18,998 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-17 01:50:19,000 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-17 01:50:19,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 01:50:19,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 01:50:19,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:19,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:19,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:50:19,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:50:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 01:50:20,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:50:20,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:50:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793348432] [2025-03-17 01:50:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793348432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:20,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:50:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338825704] [2025-03-17 01:50:20,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:20,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:50:20,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:50:20,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:50:20,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:50:20,604 INFO L87 Difference]: Start difference. First operand 76 states and 118 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:23,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:50:25,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:50:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:25,314 INFO L93 Difference]: Finished difference Result 227 states and 353 transitions. [2025-03-17 01:50:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:50:25,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2025-03-17 01:50:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:25,340 INFO L225 Difference]: With dead ends: 227 [2025-03-17 01:50:25,340 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 01:50:25,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 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-17 01:50:25,341 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 85 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:25,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 360 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 01:50:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 01:50:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2025-03-17 01:50:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:50:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2025-03-17 01:50:25,373 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 161 [2025-03-17 01:50:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:25,374 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2025-03-17 01:50:25,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2025-03-17 01:50:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 01:50:25,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:25,379 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:25,393 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 (3)] Ended with exit code 0 [2025-03-17 01:50:25,580 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-17 01:50:25,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash -627621102, now seen corresponding path program 1 times [2025-03-17 01:50:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:50:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420629554] [2025-03-17 01:50:25,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:25,581 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-17 01:50:25,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:50:25,583 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-17 01:50:25,584 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-17 01:50:25,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 01:50:25,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 01:50:25,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:25,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:25,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:50:25,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:50:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 01:50:27,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:50:27,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:50:27,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420629554] [2025-03-17 01:50:27,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420629554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:27,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:27,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:50:27,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527899000] [2025-03-17 01:50:27,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:27,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:50:27,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:50:27,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:50:27,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:50:27,336 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:29,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:50:31,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:50:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:31,420 INFO L93 Difference]: Finished difference Result 227 states and 352 transitions. [2025-03-17 01:50:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:50:31,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 162 [2025-03-17 01:50:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:31,441 INFO L225 Difference]: With dead ends: 227 [2025-03-17 01:50:31,441 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 01:50:31,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 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-17 01:50:31,442 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 83 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:31,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 361 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-17 01:50:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 01:50:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 124. [2025-03-17 01:50:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:50:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 190 transitions. [2025-03-17 01:50:31,458 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 190 transitions. Word has length 162 [2025-03-17 01:50:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:31,459 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 190 transitions. [2025-03-17 01:50:31,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-17 01:50:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 190 transitions. [2025-03-17 01:50:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 01:50:31,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:31,460 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:31,474 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 (4)] Forceful destruction successful, exit code 0 [2025-03-17 01:50:31,661 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-17 01:50:31,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:31,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:31,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1624693455, now seen corresponding path program 1 times [2025-03-17 01:50:31,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:50:31,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748392211] [2025-03-17 01:50:31,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:31,662 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-17 01:50:31,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:50:31,664 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-17 01:50:31,665 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-17 01:50:31,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 01:50:31,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 01:50:31,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:31,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:31,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:50:31,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:50:32,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-17 01:50:32,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:50:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 01:50:32,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:50:32,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748392211] [2025-03-17 01:50:32,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748392211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:50:32,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:50:32,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-17 01:50:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311233839] [2025-03-17 01:50:32,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:50:32,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:50:32,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:50:32,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:50:32,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:50:32,553 INFO L87 Difference]: Start difference. First operand 124 states and 190 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-17 01:50:36,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:50:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:36,234 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2025-03-17 01:50:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:50:36,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 162 [2025-03-17 01:50:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:36,236 INFO L225 Difference]: With dead ends: 214 [2025-03-17 01:50:36,236 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 01:50:36,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:50:36,237 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 81 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:36,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 198 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-17 01:50:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 01:50:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2025-03-17 01:50:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 76 states have internal predecessors, (92), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:50:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2025-03-17 01:50:36,255 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 192 transitions. Word has length 162 [2025-03-17 01:50:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:36,256 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 192 transitions. [2025-03-17 01:50:36,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-17 01:50:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 192 transitions. [2025-03-17 01:50:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 01:50:36,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:36,257 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:36,272 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 (5)] Ended with exit code 0 [2025-03-17 01:50:36,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-17 01:50:36,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:36,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash -737189774, now seen corresponding path program 1 times [2025-03-17 01:50:36,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:50:36,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731552811] [2025-03-17 01:50:36,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:36,459 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-17 01:50:36,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:50:36,461 INFO L229 MonitoredProcess]: Starting monitored process 6 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-17 01:50:36,463 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 (6)] Waiting until timeout for monitored process [2025-03-17 01:50:36,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 01:50:36,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 01:50:36,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:36,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:36,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 01:50:36,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:50:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 78 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-17 01:50:37,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:50:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 01:50:38,014 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:50:38,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731552811] [2025-03-17 01:50:38,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731552811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:50:38,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:50:38,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-03-17 01:50:38,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863800476] [2025-03-17 01:50:38,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:50:38,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 01:50:38,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:50:38,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 01:50:38,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:50:38,016 INFO L87 Difference]: Start difference. First operand 131 states and 192 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-03-17 01:50:40,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:50:42,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:50:42,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:42,853 INFO L93 Difference]: Finished difference Result 281 states and 390 transitions. [2025-03-17 01:50:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 01:50:42,854 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 162 [2025-03-17 01:50:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:42,855 INFO L225 Difference]: With dead ends: 281 [2025-03-17 01:50:42,856 INFO L226 Difference]: Without dead ends: 203 [2025-03-17 01:50:42,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-03-17 01:50:42,857 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 199 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:42,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 363 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 01:50:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-17 01:50:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 177. [2025-03-17 01:50:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 109 states have (on average 1.18348623853211) internal successors, (129), 110 states have internal predecessors, (129), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 01:50:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 245 transitions. [2025-03-17 01:50:42,875 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 245 transitions. Word has length 162 [2025-03-17 01:50:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:42,875 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 245 transitions. [2025-03-17 01:50:42,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-03-17 01:50:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 245 transitions. [2025-03-17 01:50:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 01:50:42,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:42,878 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:50:42,891 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 (6)] Ended with exit code 0 [2025-03-17 01:50:43,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-17 01:50:43,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:43,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash -736266253, now seen corresponding path program 1 times [2025-03-17 01:50:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:50:43,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258805056] [2025-03-17 01:50:43,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:43,079 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-17 01:50:43,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:50:43,081 INFO L229 MonitoredProcess]: Starting monitored process 7 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-17 01:50:43,082 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 (7)] Waiting until timeout for monitored process [2025-03-17 01:50:43,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 01:50:43,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 01:50:43,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:43,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:43,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 01:50:43,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:51:25,813 WARN L286 SmtUtils]: Spent 13.90s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)