./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.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_fillercodesize_ps-cn-10_file-27.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 b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:52:17,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:52:17,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:52:17,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:52:17,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:52:17,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:52:17,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:52:17,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:52:17,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:52:17,396 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:52:17,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:52:17,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:52:17,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:52:17,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:52:17,397 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:52:17,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:52:17,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:52:17,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:52:17,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:52:17,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:52:17,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:52:17,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:52:17,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:52:17,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:52:17,399 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 -> b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 [2025-03-16 23:52:17,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:52:17,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:52:17,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:52:17,649 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:52:17,649 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:52:17,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-16 23:52:18,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2ecfaab/63f351e7bbf94037aa184b78f1be4eb6/FLAG02efa27c6 [2025-03-16 23:52:19,032 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:52:19,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-16 23:52:19,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2ecfaab/63f351e7bbf94037aa184b78f1be4eb6/FLAG02efa27c6 [2025-03-16 23:52:19,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2ecfaab/63f351e7bbf94037aa184b78f1be4eb6 [2025-03-16 23:52:19,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:52:19,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:52:19,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:52:19,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:52:19,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:52:19,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4509bdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19, skipping insertion in model container [2025-03-16 23:52:19,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:52:19,454 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_fillercodesize_ps-cn-10_file-27.i[915,928] [2025-03-16 23:52:19,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:52:19,515 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:52:19,525 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_fillercodesize_ps-cn-10_file-27.i[915,928] [2025-03-16 23:52:19,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:52:19,576 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:52:19,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19 WrapperNode [2025-03-16 23:52:19,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:52:19,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:52:19,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:52:19,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:52:19,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,626 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2025-03-16 23:52:19,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:52:19,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:52:19,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:52:19,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:52:19,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,656 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:52:19,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:52:19,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:52:19,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:52:19,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:52:19,678 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (1/1) ... [2025-03-16 23:52:19,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:52:19,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:52:19,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:52:19,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:52:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:52:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:52:19,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:52:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:52:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:52:19,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:52:19,785 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:52:19,787 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:52:20,003 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-16 23:52:20,037 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:52:20,037 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:52:20,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:52:20,051 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-16 23:52:20,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:52:20 BoogieIcfgContainer [2025-03-16 23:52:20,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:52:20,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:52:20,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:52:20,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:52:20,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:52:19" (1/3) ... [2025-03-16 23:52:20,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5803c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:52:20, skipping insertion in model container [2025-03-16 23:52:20,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:19" (2/3) ... [2025-03-16 23:52:20,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5803c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:52:20, skipping insertion in model container [2025-03-16 23:52:20,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:52:20" (3/3) ... [2025-03-16 23:52:20,059 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-16 23:52:20,070 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:52:20,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:52:20,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:52:20,120 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;@38f2a20a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:52:20,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:52:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:52:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 23:52:20,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:20,137 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:20,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:20,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2031617874, now seen corresponding path program 1 times [2025-03-16 23:52:20,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:52:20,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334261476] [2025-03-16 23:52:20,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:52:20,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 23:52:20,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 23:52:20,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:20,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-16 23:52:20,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:52:20,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334261476] [2025-03-16 23:52:20,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334261476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:52:20,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476022512] [2025-03-16 23:52:20,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:20,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:52:20,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:52:20,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:52:20,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:52:20,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 23:52:20,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 23:52:20,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:20,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:20,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:52:20,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:52:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-16 23:52:20,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:52:20,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476022512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:52:20,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:52:20,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:52:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011532489] [2025-03-16 23:52:20,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:52:20,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:52:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:52:20,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:52:20,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:52:20,569 INFO L87 Difference]: Start difference. First operand has 79 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:52:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:52:20,589 INFO L93 Difference]: Finished difference Result 155 states and 271 transitions. [2025-03-16 23:52:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:52:20,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 178 [2025-03-16 23:52:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:52:20,597 INFO L225 Difference]: With dead ends: 155 [2025-03-16 23:52:20,597 INFO L226 Difference]: Without dead ends: 77 [2025-03-16 23:52:20,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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-16 23:52:20,603 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:52:20,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:52:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-16 23:52:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-16 23:52:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:52:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2025-03-16 23:52:20,641 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 178 [2025-03-16 23:52:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:52:20,641 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2025-03-16 23:52:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:52:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2025-03-16 23:52:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 23:52:20,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:20,644 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:20,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:52:20,845 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-16 23:52:20,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:20,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -356061047, now seen corresponding path program 1 times [2025-03-16 23:52:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:52:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659626738] [2025-03-16 23:52:20,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:52:20,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 23:52:20,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 23:52:20,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:20,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:52:21,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:52:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659626738] [2025-03-16 23:52:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659626738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:52:21,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:52:21,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:52:21,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498359568] [2025-03-16 23:52:21,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:52:21,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:52:21,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:52:21,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:52:21,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:52:21,251 INFO L87 Difference]: Start difference. First operand 77 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:52:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:52:21,324 INFO L93 Difference]: Finished difference Result 229 states and 352 transitions. [2025-03-16 23:52:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:52:21,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 178 [2025-03-16 23:52:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:52:21,326 INFO L225 Difference]: With dead ends: 229 [2025-03-16 23:52:21,326 INFO L226 Difference]: Without dead ends: 153 [2025-03-16 23:52:21,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:52:21,328 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 60 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:52:21,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 325 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:52:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-16 23:52:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2025-03-16 23:52:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 88 states have internal predecessors, (112), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-16 23:52:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2025-03-16 23:52:21,358 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 178 [2025-03-16 23:52:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:52:21,358 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2025-03-16 23:52:21,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:52:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2025-03-16 23:52:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 23:52:21,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:21,360 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:21,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:52:21,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:21,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1927904512, now seen corresponding path program 1 times [2025-03-16 23:52:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:52:21,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246920006] [2025-03-16 23:52:21,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:52:21,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 23:52:21,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 23:52:21,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:21,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:52:21,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:52:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246920006] [2025-03-16 23:52:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246920006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:52:21,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:52:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:52:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367146693] [2025-03-16 23:52:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:52:21,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:52:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:52:21,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:52:21,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:52:21,648 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:52:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:52:21,804 INFO L93 Difference]: Finished difference Result 299 states and 459 transitions. [2025-03-16 23:52:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:52:21,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 179 [2025-03-16 23:52:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:52:21,808 INFO L225 Difference]: With dead ends: 299 [2025-03-16 23:52:21,810 INFO L226 Difference]: Without dead ends: 151 [2025-03-16 23:52:21,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:52:21,813 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 116 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:52:21,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 153 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:52:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-16 23:52:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-16 23:52:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 90 states have internal predecessors, (114), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-16 23:52:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2025-03-16 23:52:21,847 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 179 [2025-03-16 23:52:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:52:21,847 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2025-03-16 23:52:21,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:52:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2025-03-16 23:52:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 23:52:21,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:21,852 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:21,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:52:21,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:21,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:21,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1569350162, now seen corresponding path program 1 times [2025-03-16 23:52:21,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:52:21,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761723787] [2025-03-16 23:52:21,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:52:21,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 23:52:21,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 23:52:21,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:21,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:52:21,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:52:22,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 23:52:22,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 23:52:22,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:22,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:52:22,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:52:22,164 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:52:22,165 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:52:22,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:52:22,168 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-16 23:52:22,282 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:52:22,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:52:22 BoogieIcfgContainer [2025-03-16 23:52:22,285 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:52:22,286 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:52:22,286 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:52:22,286 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:52:22,286 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:52:20" (3/4) ... [2025-03-16 23:52:22,288 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:52:22,289 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:52:22,289 INFO L158 Benchmark]: Toolchain (without parser) took 2959.84ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 126.7MB in the end (delta: 27.3MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2025-03-16 23:52:22,289 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:52:22,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.41ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 139.2MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:52:22,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.73ms. Allocated memory is still 201.3MB. Free memory was 139.2MB in the beginning and 136.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:52:22,290 INFO L158 Benchmark]: Boogie Preprocessor took 48.34ms. Allocated memory is still 201.3MB. Free memory was 136.3MB in the beginning and 133.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:52:22,290 INFO L158 Benchmark]: IcfgBuilder took 375.21ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 110.8MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:52:22,290 INFO L158 Benchmark]: TraceAbstraction took 2232.23ms. Allocated memory is still 201.3MB. Free memory was 110.0MB in the beginning and 126.8MB in the end (delta: -16.8MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-03-16 23:52:22,290 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 126.7MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:52:22,294 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.21ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.41ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 139.2MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.73ms. Allocated memory is still 201.3MB. Free memory was 139.2MB in the beginning and 136.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.34ms. Allocated memory is still 201.3MB. Free memory was 136.3MB in the beginning and 133.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 375.21ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 110.8MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2232.23ms. Allocated memory is still 201.3MB. Free memory was 110.0MB in the beginning and 126.8MB in the end (delta: -16.8MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 126.7MB in the end (delta: 55.4kB). 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 121, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 127, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] signed short int var_1_24 = -256; [L44] unsigned short int var_1_25 = 32; [L45] unsigned short int var_1_26 = 128; [L46] double var_1_27 = 25.5; [L47] double var_1_28 = 200.9; [L48] signed char var_1_29 = -10; [L49] signed char var_1_30 = -32; [L50] signed char var_1_31 = -5; [L51] unsigned char var_1_32 = 1; [L52] double var_1_33 = 199.5; [L53] unsigned long int var_1_34 = 4; [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] FCALL updateLastVariables() [L166] CALL updateVariables() [L108] var_1_2 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L109] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L110] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L110] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L111] var_1_3 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L112] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L113] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L113] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L114] var_1_4 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L115] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L116] var_1_5 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L117] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L118] var_1_6 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_7=316/5, var_1_8=1] [L119] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_7=316/5, var_1_8=1] [L120] var_1_7 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L121] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L122] var_1_11 = __VERIFIER_nondet_ulong() [L123] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L123] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L124] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L124] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L125] var_1_13 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L126] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L127] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L127] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L128] var_1_15 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L129] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L130] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L130] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L131] var_1_16 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L132] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L133] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L133] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L134] var_1_17 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L135] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L136] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L136] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L137] var_1_19 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L138] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L139] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L139] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L140] var_1_24 = __VERIFIER_nondet_short() [L141] CALL assume_abort_if_not(var_1_24 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L141] RET assume_abort_if_not(var_1_24 >= -32767) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L142] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L142] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L143] var_1_26 = __VERIFIER_nondet_ushort() [L144] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L144] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L145] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L145] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L146] var_1_28 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L147] RET assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L148] var_1_30 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L149] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L150] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L150] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L151] var_1_31 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L152] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L153] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-32767, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=1, var_1_8=1] [L166] RET updateVariables() [L167] CALL step() [L57] var_1_23 = var_1_24 [L58] var_1_25 = var_1_26 [L59] var_1_27 = var_1_28 [L60] var_1_29 = ((((((((10) > (var_1_30)) ? (10) : (var_1_30)))) < (((((var_1_31) > (-8)) ? (var_1_31) : (-8))))) ? (((((10) > (var_1_30)) ? (10) : (var_1_30)))) : (((((var_1_31) > (-8)) ? (var_1_31) : (-8)))))) [L61] var_1_32 = 1 [L62] var_1_33 = var_1_28 [L63] var_1_34 = var_1_26 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=1] [L64] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L65] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=1] [L67] var_1_20 = var_1_11 [L68] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=1] [L69] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=1] [L69] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L70] COND TRUE var_1_12 != var_1_21 [L71] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=1] [L76] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=1] [L87] unsigned char stepLocal_1 = var_1_14; [L88] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=1] [L89] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=1] [L90] COND TRUE stepLocal_1 || var_1_14 [L91] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=1] [L98] COND FALSE !(var_1_6 > (- var_1_7)) [L103] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=0] [L105] var_1_22 = var_1_8 [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=0] [L158-L159] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_23=-32767, var_1_24=-32767, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=10, var_1_2=1, var_1_30=10, var_1_31=11, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 151 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 594 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 259 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 335 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 709 ConstructedInterpolants, 0 QuantifiedInterpolants, 836 SizeOfPredicates, 0 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 6440/6496 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 23:52:22,314 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_fillercodesize_ps-cn-10_file-27.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 b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:52:24,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:52:24,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:52:24,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:52:24,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:52:24,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:52:24,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:52:24,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:52:24,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:52:24,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:52:24,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:52:24,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:52:24,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:52:24,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:52:24,253 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:52:24,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:52:24,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:52:24,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:52:24,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:52:24,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:52:24,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:52:24,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:52:24,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:52:24,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:52:24,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:52:24,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:52:24,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:52:24,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:52:24,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:52:24,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:52:24,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:52:24,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:52:24,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:52:24,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:52:24,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:52:24,257 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 -> b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 [2025-03-16 23:52:24,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:52:24,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:52:24,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:52:24,493 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:52:24,495 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:52:24,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-16 23:52:25,702 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3522da29/a6d9ed22e49b4014baeb09a82026822f/FLAGdc086efee [2025-03-16 23:52:25,917 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:52:25,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-16 23:52:25,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3522da29/a6d9ed22e49b4014baeb09a82026822f/FLAGdc086efee [2025-03-16 23:52:26,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3522da29/a6d9ed22e49b4014baeb09a82026822f [2025-03-16 23:52:26,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:52:26,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:52:26,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:52:26,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:52:26,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:52:26,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3734e123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26, skipping insertion in model container [2025-03-16 23:52:26,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:52:26,391 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_fillercodesize_ps-cn-10_file-27.i[915,928] [2025-03-16 23:52:26,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:52:26,482 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:52:26,490 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_fillercodesize_ps-cn-10_file-27.i[915,928] [2025-03-16 23:52:26,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:52:26,545 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:52:26,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26 WrapperNode [2025-03-16 23:52:26,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:52:26,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:52:26,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:52:26,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:52:26,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,586 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-16 23:52:26,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:52:26,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:52:26,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:52:26,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:52:26,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,611 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:52:26,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:52:26,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:52:26,627 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:52:26,627 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:52:26,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (1/1) ... [2025-03-16 23:52:26,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:52:26,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:52:26,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:52:26,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:52:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:52:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:52:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:52:26,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:52:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:52:26,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:52:26,757 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:52:26,759 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:52:31,988 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 23:52:31,988 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:52:31,995 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:52:31,995 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:52:31,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:52:31 BoogieIcfgContainer [2025-03-16 23:52:31,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:52:31,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:52:31,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:52:32,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:52:32,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:52:26" (1/3) ... [2025-03-16 23:52:32,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f9660e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:52:32, skipping insertion in model container [2025-03-16 23:52:32,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:52:26" (2/3) ... [2025-03-16 23:52:32,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f9660e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:52:32, skipping insertion in model container [2025-03-16 23:52:32,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:52:31" (3/3) ... [2025-03-16 23:52:32,003 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-16 23:52:32,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:52:32,016 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:52:32,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:52:32,060 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;@789b299b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:52:32,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:52:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:52:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 23:52:32,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:32,075 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:32,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:32,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash 520437908, now seen corresponding path program 1 times [2025-03-16 23:52:32,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:52:32,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572884561] [2025-03-16 23:52:32,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:32,094 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-16 23:52:32,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:52:32,096 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-16 23:52:32,098 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-16 23:52:32,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 23:52:32,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 23:52:32,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:32,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:32,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:52:32,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:52:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 740 proven. 0 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2025-03-16 23:52:32,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:52:32,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:52:32,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572884561] [2025-03-16 23:52:32,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572884561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:52:32,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:52:32,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:52:32,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148507009] [2025-03-16 23:52:32,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:52:32,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:52:32,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:52:32,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:52:32,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:52:32,616 INFO L87 Difference]: Start difference. First operand has 71 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:52:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:52:32,634 INFO L93 Difference]: Finished difference Result 139 states and 249 transitions. [2025-03-16 23:52:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:52:32,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 174 [2025-03-16 23:52:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:52:32,639 INFO L225 Difference]: With dead ends: 139 [2025-03-16 23:52:32,639 INFO L226 Difference]: Without dead ends: 69 [2025-03-16 23:52:32,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 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-16 23:52:32,647 INFO L435 NwaCegarLoop]: 107 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, 107 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-16 23:52:32,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:52:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-16 23:52:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-16 23:52:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:52:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2025-03-16 23:52:32,680 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 174 [2025-03-16 23:52:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:52:32,680 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 107 transitions. [2025-03-16 23:52:32,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:52:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 107 transitions. [2025-03-16 23:52:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 23:52:32,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:32,683 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:32,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 23:52:32,884 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-16 23:52:32,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:32,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:32,885 INFO L85 PathProgramCache]: Analyzing trace with hash -155689489, now seen corresponding path program 1 times [2025-03-16 23:52:32,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:52:32,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756535863] [2025-03-16 23:52:32,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:32,885 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-16 23:52:32,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:52:32,889 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-16 23:52:32,890 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-16 23:52:32,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 23:52:33,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 23:52:33,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:33,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:33,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 23:52:33,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:52:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 730 proven. 57 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2025-03-16 23:52:34,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:52:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:52:34,803 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:52:34,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756535863] [2025-03-16 23:52:34,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756535863] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 23:52:34,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:52:34,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-16 23:52:34,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568406358] [2025-03-16 23:52:34,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:52:34,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:52:34,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:52:34,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:52:34,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 23:52:34,805 INFO L87 Difference]: Start difference. First operand 69 states and 107 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:52:38,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:52:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:52:38,584 INFO L93 Difference]: Finished difference Result 141 states and 216 transitions. [2025-03-16 23:52:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:52:38,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 174 [2025-03-16 23:52:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:52:38,619 INFO L225 Difference]: With dead ends: 141 [2025-03-16 23:52:38,619 INFO L226 Difference]: Without dead ends: 73 [2025-03-16 23:52:38,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 23:52:38,620 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 48 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:52:38,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 155 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-16 23:52:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-16 23:52:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-16 23:52:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:52:38,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2025-03-16 23:52:38,631 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 174 [2025-03-16 23:52:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:52:38,632 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2025-03-16 23:52:38,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:52:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2025-03-16 23:52:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 23:52:38,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:38,634 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:38,646 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-16 23:52:38,834 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-16 23:52:38,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:38,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:38,835 INFO L85 PathProgramCache]: Analyzing trace with hash -185010856, now seen corresponding path program 1 times [2025-03-16 23:52:38,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:52:38,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066152576] [2025-03-16 23:52:38,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:38,836 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-16 23:52:38,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:52:38,838 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-16 23:52:38,839 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-16 23:52:38,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 23:52:39,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 23:52:39,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:39,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:39,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 23:52:39,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:52:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:52:40,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:52:40,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:52:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066152576] [2025-03-16 23:52:40,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066152576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:52:40,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:52:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:52:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492732733] [2025-03-16 23:52:40,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:52:40,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:52:40,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:52:40,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:52:40,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:52:40,336 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:52:44,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:52:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:52:44,642 INFO L93 Difference]: Finished difference Result 217 states and 325 transitions. [2025-03-16 23:52:44,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:52:44,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 175 [2025-03-16 23:52:44,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:52:44,674 INFO L225 Difference]: With dead ends: 217 [2025-03-16 23:52:44,674 INFO L226 Difference]: Without dead ends: 145 [2025-03-16 23:52:44,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 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-16 23:52:44,677 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 15 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:52:44,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 207 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 23:52:44,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-16 23:52:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2025-03-16 23:52:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 78 states have (on average 1.205128205128205) internal successors, (94), 78 states have internal predecessors, (94), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-16 23:52:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2025-03-16 23:52:44,704 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 175 [2025-03-16 23:52:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:52:44,705 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2025-03-16 23:52:44,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:52:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2025-03-16 23:52:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 23:52:44,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:44,706 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:44,717 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-16 23:52:44,907 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-16 23:52:44,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:44,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2060335117, now seen corresponding path program 1 times [2025-03-16 23:52:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:52:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917479410] [2025-03-16 23:52:44,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:44,908 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-16 23:52:44,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:52:44,910 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-16 23:52:44,911 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-16 23:52:44,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 23:52:45,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 23:52:45,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:45,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:45,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 23:52:45,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:52:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 965 proven. 117 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-16 23:52:46,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:52:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 117 proven. 126 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2025-03-16 23:52:48,124 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:52:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917479410] [2025-03-16 23:52:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917479410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:52:48,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:52:48,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2025-03-16 23:52:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263591459] [2025-03-16 23:52:48,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:52:48,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 23:52:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:52:48,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 23:52:48,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-03-16 23:52:48,125 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (45), 4 states have call predecessors, (45), 10 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 23:52:54,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:52:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:52:56,234 INFO L93 Difference]: Finished difference Result 376 states and 523 transitions. [2025-03-16 23:52:56,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-16 23:52:56,235 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (45), 4 states have call predecessors, (45), 10 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 176 [2025-03-16 23:52:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:52:56,238 INFO L225 Difference]: With dead ends: 376 [2025-03-16 23:52:56,238 INFO L226 Difference]: Without dead ends: 304 [2025-03-16 23:52:56,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=589, Invalid=1573, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 23:52:56,239 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 404 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 348 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:52:56,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 451 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 675 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2025-03-16 23:52:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-16 23:52:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 269. [2025-03-16 23:52:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 153 states have (on average 1.1437908496732025) internal successors, (175), 154 states have internal predecessors, (175), 99 states have call successors, (99), 16 states have call predecessors, (99), 16 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-16 23:52:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 373 transitions. [2025-03-16 23:52:56,280 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 373 transitions. Word has length 176 [2025-03-16 23:52:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:52:56,281 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 373 transitions. [2025-03-16 23:52:56,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (45), 4 states have call predecessors, (45), 10 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 23:52:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 373 transitions. [2025-03-16 23:52:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 23:52:56,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:56,286 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:56,298 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 (5)] Forceful destruction successful, exit code 0 [2025-03-16 23:52:56,486 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-16 23:52:56,487 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:56,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1409801718, now seen corresponding path program 1 times [2025-03-16 23:52:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:52:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180558527] [2025-03-16 23:52:56,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:56,488 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-16 23:52:56,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:52:56,491 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-16 23:52:56,492 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-16 23:52:56,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 23:52:56,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 23:52:56,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:56,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:56,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 23:52:56,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:53:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 46 proven. 672 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2025-03-16 23:53:00,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:53:00,624 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:53:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180558527] [2025-03-16 23:53:00,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180558527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:53:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [790730161] [2025-03-16 23:53:00,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:00,625 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-16 23:53:00,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-16 23:53:00,644 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-16 23:53:00,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-16 23:53:00,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 23:53:01,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 23:53:01,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:01,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:53:01,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 23:53:01,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:53:41,884 WARN L286 SmtUtils]: Spent 8.70s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)