./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.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 4fec42760cab0c7921ee441a80b2db245828099f977d4542ad766988bcefeb3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:45:13,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:45:13,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:45:13,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:45:13,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:45:13,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:45:13,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:45:13,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:45:13,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:45:13,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:45:13,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:45:13,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:45:13,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:45:13,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:45:13,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:45:13,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:45:13,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:45:13,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:45:13,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:45:13,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:45:13,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:45:13,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:45:13,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:45:13,524 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:45:13,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:45:13,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:45:13,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:45:13,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:45:13,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:45:13,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:45:13,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:45:13,525 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 -> 4fec42760cab0c7921ee441a80b2db245828099f977d4542ad766988bcefeb3a [2025-03-17 00:45:13,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:45:13,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:45:13,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:45:13,773 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:45:13,773 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:45:13,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2025-03-17 00:45:14,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0298d5cd9/f5ab415283c24a02904efe343d4769bd/FLAG1a2afef41 [2025-03-17 00:45:15,175 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:45:15,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2025-03-17 00:45:15,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0298d5cd9/f5ab415283c24a02904efe343d4769bd/FLAG1a2afef41 [2025-03-17 00:45:15,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0298d5cd9/f5ab415283c24a02904efe343d4769bd [2025-03-17 00:45:15,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:45:15,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:45:15,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:45:15,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:45:15,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:45:15,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582b782d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15, skipping insertion in model container [2025-03-17 00:45:15,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:45:15,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i[919,932] [2025-03-17 00:45:15,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:45:15,707 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:45:15,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i[919,932] [2025-03-17 00:45:15,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:45:15,765 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:45:15,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15 WrapperNode [2025-03-17 00:45:15,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:45:15,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:45:15,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:45:15,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:45:15,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,833 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2025-03-17 00:45:15,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:45:15,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:45:15,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:45:15,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:45:15,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,869 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:45:15,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:45:15,888 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:45:15,888 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:45:15,888 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:45:15,889 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (1/1) ... [2025-03-17 00:45:15,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:45:15,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:45:15,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:45:15,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:45:15,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:45:15,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:45:15,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:45:15,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:45:15,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:45:15,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:45:15,995 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:45:15,997 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:45:16,284 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L168: havoc property_#t~ite19#1;havoc property_#t~bitwise18#1;havoc property_#t~short20#1; [2025-03-17 00:45:16,304 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 00:45:16,304 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:45:16,315 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:45:16,316 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:45:16,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:45:16 BoogieIcfgContainer [2025-03-17 00:45:16,316 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:45:16,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:45:16,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:45:16,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:45:16,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:45:15" (1/3) ... [2025-03-17 00:45:16,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678535a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:45:16, skipping insertion in model container [2025-03-17 00:45:16,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:15" (2/3) ... [2025-03-17 00:45:16,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678535a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:45:16, skipping insertion in model container [2025-03-17 00:45:16,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:45:16" (3/3) ... [2025-03-17 00:45:16,324 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2025-03-17 00:45:16,334 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:45:16,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:45:16,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:45:16,388 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;@83415fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:45:16,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:45:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 00:45:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 00:45:16,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:45:16,404 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:45:16,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:45:16,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:45:16,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1685713838, now seen corresponding path program 1 times [2025-03-17 00:45:16,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:45:16,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186936117] [2025-03-17 00:45:16,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:45:16,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:45:16,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:45:16,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:45:16,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:45:16,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:45:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 00:45:16,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:45:16,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186936117] [2025-03-17 00:45:16,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186936117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:45:16,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467083071] [2025-03-17 00:45:16,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:45:16,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:45:16,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:45:16,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:45:16,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:45:16,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:45:16,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:45:16,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:45:16,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:45:16,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:45:16,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:45:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 00:45:16,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:45:16,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467083071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:45:16,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:45:16,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:45:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526314088] [2025-03-17 00:45:16,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:45:16,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:45:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:45:16,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:45:16,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:45:16,828 INFO L87 Difference]: Start difference. First operand has 79 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 00:45:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:45:16,858 INFO L93 Difference]: Finished difference Result 155 states and 267 transitions. [2025-03-17 00:45:16,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:45:16,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-03-17 00:45:16,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:45:16,864 INFO L225 Difference]: With dead ends: 155 [2025-03-17 00:45:16,864 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 00:45:16,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:45:16,871 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:45:16,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:45:16,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 00:45:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 00:45:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 00:45:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2025-03-17 00:45:16,907 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 139 [2025-03-17 00:45:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:45:16,908 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2025-03-17 00:45:16,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 00:45:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2025-03-17 00:45:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:45:16,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:45:16,910 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:45:16,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:45:17,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:45:17,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:45:17,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:45:17,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1822477100, now seen corresponding path program 1 times [2025-03-17 00:45:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:45:17,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562617447] [2025-03-17 00:45:17,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:45:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:45:17,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:45:17,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:45:17,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:45:17,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:45:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 00:45:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:45:17,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562617447] [2025-03-17 00:45:17,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562617447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:45:17,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:45:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:45:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510807804] [2025-03-17 00:45:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:45:17,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:45:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:45:17,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:45:17,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:45:17,296 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 00:45:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:45:17,375 INFO L93 Difference]: Finished difference Result 188 states and 290 transitions. [2025-03-17 00:45:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:45:17,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2025-03-17 00:45:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:45:17,378 INFO L225 Difference]: With dead ends: 188 [2025-03-17 00:45:17,379 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 00:45:17,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:45:17,380 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 40 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:45:17,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 217 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:45:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 00:45:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2025-03-17 00:45:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 00:45:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2025-03-17 00:45:17,395 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 140 [2025-03-17 00:45:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:45:17,397 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2025-03-17 00:45:17,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 00:45:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2025-03-17 00:45:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 00:45:17,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:45:17,401 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:45:17,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:45:17,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:45:17,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:45:17,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1353673890, now seen corresponding path program 1 times [2025-03-17 00:45:17,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:45:17,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884371875] [2025-03-17 00:45:17,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:45:17,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:45:17,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 00:45:17,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 00:45:17,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:45:17,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:45:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217172907] [2025-03-17 00:45:17,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:45:17,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:45:17,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:45:17,575 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:45:17,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:45:17,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 00:45:17,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 00:45:17,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:45:17,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:45:17,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 00:45:17,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 00:45:17,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 00:45:17,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:45:17,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:45:18,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 00:45:18,011 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 00:45:18,012 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 00:45:18,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:45:18,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 00:45:18,216 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 00:45:18,289 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 00:45:18,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:45:18 BoogieIcfgContainer [2025-03-17 00:45:18,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 00:45:18,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 00:45:18,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 00:45:18,293 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 00:45:18,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:45:16" (3/4) ... [2025-03-17 00:45:18,296 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 00:45:18,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 00:45:18,297 INFO L158 Benchmark]: Toolchain (without parser) took 2777.76ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 62.5MB in the end (delta: 50.6MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2025-03-17 00:45:18,297 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:45:18,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.36ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 97.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 00:45:18,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.63ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 93.2MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:45:18,298 INFO L158 Benchmark]: Boogie Preprocessor took 52.73ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 87.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 00:45:18,298 INFO L158 Benchmark]: IcfgBuilder took 428.39ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 58.9MB in the end (delta: 28.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 00:45:18,298 INFO L158 Benchmark]: TraceAbstraction took 1973.53ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 62.5MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:45:18,298 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 142.6MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:45:18,299 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.36ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 97.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.63ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 93.2MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.73ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 87.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 428.39ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 58.9MB in the end (delta: 28.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1973.53ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 62.5MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 142.6MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 151, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryArithmeticFLOAToperation at line 66, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 128; [L25] unsigned char var_1_4 = 2; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 32; [L28] unsigned short int var_1_8 = 100; [L29] float var_1_9 = 255.75; [L30] signed char var_1_10 = 64; [L31] signed char var_1_11 = 32; [L32] signed char var_1_12 = 4; [L33] float var_1_13 = 0.0; [L34] float var_1_14 = 7.25; [L35] float var_1_15 = 8.125; [L36] float var_1_16 = 24.5; [L37] signed short int var_1_17 = -256; [L38] double var_1_18 = 31.5; [L39] float var_1_19 = 255.2; [L40] signed long int var_1_21 = -8; [L41] double var_1_22 = 0.5; [L42] unsigned short int var_1_23 = 200; [L43] double var_1_26 = 1.8; [L44] unsigned short int var_1_29 = 8; [L45] unsigned char var_1_37 = 1; [L46] unsigned char var_1_39 = 0; [L47] unsigned char var_1_40 = 0; [L48] unsigned long int var_1_41 = 10; [L49] unsigned char last_1_var_1_6 = 32; [L50] unsigned short int last_1_var_1_8 = 100; [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L164] last_1_var_1_6 = var_1_6 [L165] last_1_var_1_8 = var_1_8 [L175] RET updateLastVariables() [L176] CALL updateVariables() [L129] var_1_2 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L130] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L131] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L131] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L132] var_1_3 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_3 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L133] RET assume_abort_if_not(var_1_3 >= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L134] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L134] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L135] var_1_4 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L136] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L137] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L137] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L138] var_1_5 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L139] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L140] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L140] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L141] var_1_10 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L142] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L143] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L143] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L144] var_1_11 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L145] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L146] CALL assume_abort_if_not(var_1_11 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L146] RET assume_abort_if_not(var_1_11 <= 64) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L147] var_1_12 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L148] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L149] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L149] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L151] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L152] var_1_14 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L153] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L154] var_1_16 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L155] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L156] var_1_39 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L157] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L158] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L158] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L159] var_1_40 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L160] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L161] CALL assume_abort_if_not(var_1_40 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L161] RET assume_abort_if_not(var_1_40 <= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L176] RET updateVariables() [L177] CALL step() [L54] signed long int stepLocal_0 = 64 + (var_1_5 / var_1_3); VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, stepLocal_0=65, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L55] COND TRUE stepLocal_0 != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6)) [L56] var_1_6 = var_1_4 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=100, var_1_9=1023/4] [L60] COND FALSE !(\read(var_1_2)) [L63] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=100, var_1_9=1023/4] [L65] COND TRUE ((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5 [L66] var_1_9 = (64.8f - (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=100] [L70] var_1_15 = (var_1_14 + var_1_16) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=100] [L71] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=100] [L74] COND TRUE var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13)))) [L75] var_1_17 = var_1_4 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_17=1, var_1_18=63/2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=100] [L80] COND FALSE !((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) [L85] var_1_18 = var_1_16 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=100] [L87] signed long int stepLocal_1 = var_1_3 - var_1_5; VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, stepLocal_1=0, var_1_10=127, var_1_11=0, var_1_12=0, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=100] [L88] COND TRUE (var_1_17 + var_1_6) >= stepLocal_1 [L89] var_1_8 = ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] [L93] var_1_19 = var_1_16 [L94] var_1_21 = -16 [L95] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] [L96] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] [L103] COND FALSE !(var_1_5 > var_1_5) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] [L106] COND TRUE (var_1_2 || var_1_2) || ((- var_1_16) <= var_1_14) [L107] var_1_26 = ((((9.99999999739E8) < (var_1_16)) ? (9.99999999739E8) : (var_1_16))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] [L110] COND FALSE !(var_1_2 || (var_1_16 <= var_1_16)) [L117] var_1_29 = (var_1_4 + (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) + var_1_5)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] [L119] COND TRUE var_1_2 || (var_1_17 <= (var_1_5 / var_1_3)) [L120] var_1_37 = (var_1_39 || var_1_40) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] [L122] COND FALSE !((var_1_4 + ((((var_1_10) < (var_1_3)) ? (var_1_10) : (var_1_3)))) <= var_1_4) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] [L177] RET step() [L178] CALL, EXPR property() [L168] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_17 + var_1_6) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_6)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] [L168-L169] return ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_17 + var_1_6) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_6)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=999999999739/1000, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=1, var_1_5=639, var_1_6=1, var_1_8=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 145 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 333 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 241 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2480/2520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 00:45:18,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.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 4fec42760cab0c7921ee441a80b2db245828099f977d4542ad766988bcefeb3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:45:20,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:45:20,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 00:45:20,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:45:20,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:45:20,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:45:20,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:45:20,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:45:20,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:45:20,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:45:20,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:45:20,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:45:20,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:45:20,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:45:20,263 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:45:20,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:45:20,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:45:20,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:45:20,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:45:20,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:45:20,265 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:45:20,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:45:20,265 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 00:45:20,265 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 00:45:20,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:45:20,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:45:20,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:45:20,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:45:20,265 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 -> 4fec42760cab0c7921ee441a80b2db245828099f977d4542ad766988bcefeb3a [2025-03-17 00:45:20,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:45:20,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:45:20,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:45:20,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:45:20,519 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:45:20,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2025-03-17 00:45:21,631 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06dd522b2/4b0ffdb567c345c6ae90479696084eb8/FLAGbed7fe613 [2025-03-17 00:45:21,826 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:45:21,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2025-03-17 00:45:21,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06dd522b2/4b0ffdb567c345c6ae90479696084eb8/FLAGbed7fe613 [2025-03-17 00:45:21,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06dd522b2/4b0ffdb567c345c6ae90479696084eb8 [2025-03-17 00:45:21,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:45:21,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:45:21,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:45:21,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:45:21,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:45:21,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:45:21" (1/1) ... [2025-03-17 00:45:21,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:21, skipping insertion in model container [2025-03-17 00:45:21,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:45:21" (1/1) ... [2025-03-17 00:45:21,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:45:21,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i[919,932] [2025-03-17 00:45:22,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:45:22,064 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:45:22,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i[919,932] [2025-03-17 00:45:22,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:45:22,126 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:45:22,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22 WrapperNode [2025-03-17 00:45:22,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:45:22,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:45:22,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:45:22,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:45:22,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,176 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2025-03-17 00:45:22,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:45:22,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:45:22,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:45:22,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:45:22,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,209 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:45:22,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,223 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:45:22,238 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:45:22,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:45:22,238 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:45:22,239 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (1/1) ... [2025-03-17 00:45:22,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:45:22,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:45:22,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:45:22,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:45:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:45:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 00:45:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:45:22,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:45:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:45:22,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:45:22,352 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:45:22,353 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:45:29,253 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 00:45:29,253 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:45:29,261 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:45:29,261 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:45:29,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:45:29 BoogieIcfgContainer [2025-03-17 00:45:29,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:45:29,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:45:29,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:45:29,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:45:29,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:45:21" (1/3) ... [2025-03-17 00:45:29,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76aba2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:45:29, skipping insertion in model container [2025-03-17 00:45:29,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:45:22" (2/3) ... [2025-03-17 00:45:29,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76aba2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:45:29, skipping insertion in model container [2025-03-17 00:45:29,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:45:29" (3/3) ... [2025-03-17 00:45:29,269 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2025-03-17 00:45:29,278 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:45:29,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:45:29,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:45:29,323 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;@61340c27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:45:29,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:45:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.5) internal successors, (63), 43 states have internal predecessors, (63), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 00:45:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 00:45:29,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:45:29,334 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:45:29,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:45:29,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:45:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1423387626, now seen corresponding path program 1 times [2025-03-17 00:45:29,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:45:29,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331476065] [2025-03-17 00:45:29,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:45:29,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:45:29,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:45:29,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:45:29,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 00:45:29,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 00:45:29,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 00:45:29,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:45:29,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:45:29,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:45:29,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:45:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-17 00:45:29,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:45:29,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:45:29,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331476065] [2025-03-17 00:45:29,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331476065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:45:29,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:45:29,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 00:45:29,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540682608] [2025-03-17 00:45:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:45:29,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:45:29,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:45:29,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:45:29,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:45:29,794 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.5) internal successors, (63), 43 states have internal predecessors, (63), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 00:45:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:45:29,816 INFO L93 Difference]: Finished difference Result 129 states and 229 transitions. [2025-03-17 00:45:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:45:29,818 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2025-03-17 00:45:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:45:29,822 INFO L225 Difference]: With dead ends: 129 [2025-03-17 00:45:29,823 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 00:45:29,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:45:29,829 INFO L435 NwaCegarLoop]: 100 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, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:45:29,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:45:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 00:45:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 00:45:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 00:45:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2025-03-17 00:45:29,861 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 136 [2025-03-17 00:45:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:45:29,861 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2025-03-17 00:45:29,861 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 00:45:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2025-03-17 00:45:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 00:45:29,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:45:29,863 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:45:29,874 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-17 00:45:30,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:45:30,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:45:30,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:45:30,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1622449520, now seen corresponding path program 1 times [2025-03-17 00:45:30,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:45:30,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296577301] [2025-03-17 00:45:30,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:45:30,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:45:30,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:45:30,068 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:45:30,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 00:45:30,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 00:45:30,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 00:45:30,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:45:30,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:45:30,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 00:45:30,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:45:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 00:45:30,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:45:30,528 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:45:30,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296577301] [2025-03-17 00:45:30,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296577301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:45:30,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:45:30,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:45:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727759180] [2025-03-17 00:45:30,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:45:30,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:45:30,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:45:30,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:45:30,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:45:30,531 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 00:45:34,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:45:39,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:45:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:45:39,124 INFO L93 Difference]: Finished difference Result 149 states and 233 transitions. [2025-03-17 00:45:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:45:39,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2025-03-17 00:45:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:45:39,128 INFO L225 Difference]: With dead ends: 149 [2025-03-17 00:45:39,128 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 00:45:39,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:45:39,129 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:45:39,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 178 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-03-17 00:45:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 00:45:39,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2025-03-17 00:45:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 00:45:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2025-03-17 00:45:39,139 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 137 [2025-03-17 00:45:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:45:39,142 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2025-03-17 00:45:39,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 00:45:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2025-03-17 00:45:39,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 00:45:39,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:45:39,147 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:45:39,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 00:45:39,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:45:39,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:45:39,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:45:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash -329053710, now seen corresponding path program 1 times [2025-03-17 00:45:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:45:39,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050963223] [2025-03-17 00:45:39,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:45:39,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:45:39,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:45:39,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:45:39,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 00:45:39,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 00:45:39,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 00:45:39,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:45:39,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:45:39,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 00:45:39,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:45:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 00:45:40,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:45:40,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:45:40,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050963223] [2025-03-17 00:45:40,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050963223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:45:40,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:45:40,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:45:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61437747] [2025-03-17 00:45:40,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:45:40,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:45:40,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:45:40,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:45:40,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:45:40,062 INFO L87 Difference]: Start difference. First operand 80 states and 122 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 00:45:42,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:45:49,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:45:53,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:45:57,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:46:01,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:46:05,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:46:09,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:46:13,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:46:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:46:13,807 INFO L93 Difference]: Finished difference Result 224 states and 333 transitions. [2025-03-17 00:46:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:46:13,846 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 138 [2025-03-17 00:46:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:46:13,850 INFO L225 Difference]: With dead ends: 224 [2025-03-17 00:46:13,851 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 00:46:13,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:46:13,854 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 100 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:46:13,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 277 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 6 Unknown, 0 Unchecked, 33.7s Time] [2025-03-17 00:46:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 00:46:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 130. [2025-03-17 00:46:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 91 states have internal predecessors, (118), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 00:46:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2025-03-17 00:46:13,873 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 138 [2025-03-17 00:46:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:46:13,874 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2025-03-17 00:46:13,874 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 00:46:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2025-03-17 00:46:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 00:46:13,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:46:13,879 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:46:13,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 00:46:14,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:46:14,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:46:14,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:46:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash 52891346, now seen corresponding path program 1 times [2025-03-17 00:46:14,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:46:14,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701569918] [2025-03-17 00:46:14,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:46:14,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:46:14,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:46:14,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:46:14,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 00:46:14,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 00:46:14,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 00:46:14,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:46:14,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:46:14,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 00:46:14,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:46:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 308 proven. 12 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-17 00:46:16,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:46:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 48 proven. 12 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-17 00:46:17,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:46:17,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701569918] [2025-03-17 00:46:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701569918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:46:17,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:46:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-17 00:46:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067896181] [2025-03-17 00:46:17,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 00:46:17,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:46:17,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:46:17,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:46:17,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:46:17,270 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-17 00:46:26,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:46:29,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:46:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:46:29,420 INFO L93 Difference]: Finished difference Result 264 states and 385 transitions. [2025-03-17 00:46:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:46:29,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 138 [2025-03-17 00:46:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:46:29,466 INFO L225 Difference]: With dead ends: 264 [2025-03-17 00:46:29,466 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 00:46:29,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:46:29,468 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 89 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:46:29,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 151 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 11.8s Time] [2025-03-17 00:46:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 00:46:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2025-03-17 00:46:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 83 states have internal predecessors, (104), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 00:46:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 178 transitions. [2025-03-17 00:46:29,488 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 178 transitions. Word has length 138 [2025-03-17 00:46:29,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:46:29,488 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 178 transitions. [2025-03-17 00:46:29,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-17 00:46:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 178 transitions. [2025-03-17 00:46:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 00:46:29,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:46:29,492 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:46:29,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 00:46:29,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:46:29,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:46:29,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:46:29,693 INFO L85 PathProgramCache]: Analyzing trace with hash -948629712, now seen corresponding path program 1 times [2025-03-17 00:46:29,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:46:29,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056717746] [2025-03-17 00:46:29,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:46:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:46:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:46:29,695 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:46:29,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 00:46:29,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:46:30,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:46:30,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:46:30,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:46:30,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 00:46:30,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:46:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 428 proven. 24 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-17 00:46:30,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:46:31,098 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:46:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056717746] [2025-03-17 00:46:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056717746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:46:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1602385759] [2025-03-17 00:46:31,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:46:31,099 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 00:46:31,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 00:46:31,101 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-17 00:46:31,102 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-17 00:46:31,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:46:32,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:46:32,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:46:32,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:46:32,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 00:46:32,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:46:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 428 proven. 24 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-17 00:46:32,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:46:33,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1602385759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:46:33,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:46:33,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-17 00:46:33,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556029664] [2025-03-17 00:46:33,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 00:46:33,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:46:33,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:46:33,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:46:33,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:46:33,192 INFO L87 Difference]: Start difference. First operand 123 states and 178 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 00:46:38,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:46:42,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:46:43,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:46:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:46:43,949 INFO L93 Difference]: Finished difference Result 257 states and 365 transitions. [2025-03-17 00:46:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:46:43,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-03-17 00:46:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:46:43,992 INFO L225 Difference]: With dead ends: 257 [2025-03-17 00:46:43,992 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 00:46:43,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:46:43,993 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 44 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:46:43,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 163 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2025-03-17 00:46:43,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 00:46:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-03-17 00:46:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 89 states have internal predecessors, (107), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 00:46:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2025-03-17 00:46:44,006 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 139 [2025-03-17 00:46:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:46:44,006 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2025-03-17 00:46:44,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 00:46:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2025-03-17 00:46:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 00:46:44,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:46:44,007 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:46:44,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-17 00:46:44,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 00:46:44,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:46:44,409 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:46:44,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:46:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash -920000561, now seen corresponding path program 1 times [2025-03-17 00:46:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:46:44,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759966437] [2025-03-17 00:46:44,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:46:44,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:46:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:46:44,412 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:46:44,412 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 (8)] Waiting until timeout for monitored process [2025-03-17 00:46:44,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:46:45,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:46:45,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:46:45,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:46:45,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 00:46:45,079 INFO L279 TraceCheckSpWp]: Computing forward predicates...