./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_floatingpointinfluence_has-floats_file-86.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 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:41:43,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:41:43,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:41:43,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:41:43,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:41:43,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:41:43,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:41:43,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:41:43,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:41:43,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:41:43,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:41:43,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:41:43,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:41:43,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:41:43,588 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:41:43,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:41:43,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:41:43,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:41:43,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:41:43,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:41:43,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:41:43,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:41:43,591 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 -> 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 [2025-03-08 13:41:43,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:41:43,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:41:43,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:41:43,833 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:41:43,833 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:41:43,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-08 13:41:44,938 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852e08148/e7d60b350dae41308315edf5c0c22625/FLAGffaea5e93 [2025-03-08 13:41:45,178 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:41:45,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-08 13:41:45,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852e08148/e7d60b350dae41308315edf5c0c22625/FLAGffaea5e93 [2025-03-08 13:41:45,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852e08148/e7d60b350dae41308315edf5c0c22625 [2025-03-08 13:41:45,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:41:45,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:41:45,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:41:45,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:41:45,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:41:45,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45, skipping insertion in model container [2025-03-08 13:41:45,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:41:45,332 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_floatingpointinfluence_has-floats_file-86.i[917,930] [2025-03-08 13:41:45,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:41:45,399 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:41:45,408 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_floatingpointinfluence_has-floats_file-86.i[917,930] [2025-03-08 13:41:45,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:41:45,452 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:41:45,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45 WrapperNode [2025-03-08 13:41:45,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:41:45,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:41:45,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:41:45,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:41:45,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,509 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2025-03-08 13:41:45,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:41:45,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:41:45,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:41:45,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:41:45,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,542 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-08 13:41:45,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:41:45,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:41:45,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:41:45,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:41:45,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (1/1) ... [2025-03-08 13:41:45,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:41:45,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:41:45,591 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-08 13:41:45,594 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-08 13:41:45,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:41:45,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:41:45,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:41:45,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:41:45,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:41:45,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:41:45,672 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:41:45,673 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:41:45,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2025-03-08 13:41:45,985 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 13:41:45,985 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:41:46,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:41:46,001 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:41:46,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:46 BoogieIcfgContainer [2025-03-08 13:41:46,002 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:41:46,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:41:46,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:41:46,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:41:46,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:41:45" (1/3) ... [2025-03-08 13:41:46,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5daa2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:41:46, skipping insertion in model container [2025-03-08 13:41:46,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:45" (2/3) ... [2025-03-08 13:41:46,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5daa2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:41:46, skipping insertion in model container [2025-03-08 13:41:46,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:46" (3/3) ... [2025-03-08 13:41:46,009 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-08 13:41:46,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:41:46,021 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-86.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:41:46,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:41:46,076 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;@7e897b82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:41:46,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:41:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 13:41:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 13:41:46,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:41:46,088 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:41:46,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:41:46,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:41:46,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1303684503, now seen corresponding path program 1 times [2025-03-08 13:41:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:41:46,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570706930] [2025-03-08 13:41:46,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:41:46,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:41:46,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 13:41:46,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 13:41:46,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:41:46,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:41:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 13:41:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:41:46,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570706930] [2025-03-08 13:41:46,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570706930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:41:46,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092539276] [2025-03-08 13:41:46,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:41:46,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:41:46,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:41:46,334 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-08 13:41:46,338 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-08 13:41:46,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 13:41:46,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 13:41:46,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:41:46,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:41:46,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:41:46,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:41:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 13:41:46,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:41:46,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092539276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:41:46,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:41:46,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:41:46,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248904282] [2025-03-08 13:41:46,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:41:46,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:41:46,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:41:46,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:41:46,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:41:46,532 INFO L87 Difference]: Start difference. First operand has 72 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 13:41:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:41:46,560 INFO L93 Difference]: Finished difference Result 138 states and 232 transitions. [2025-03-08 13:41:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:41:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 155 [2025-03-08 13:41:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:41:46,566 INFO L225 Difference]: With dead ends: 138 [2025-03-08 13:41:46,568 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 13:41:46,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-08 13:41:46,575 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:41:46,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:41:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 13:41:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 13:41:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 13:41:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2025-03-08 13:41:46,610 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 155 [2025-03-08 13:41:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:41:46,611 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 101 transitions. [2025-03-08 13:41:46,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 13:41:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2025-03-08 13:41:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 13:41:46,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:41:46,615 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:41:46,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 13:41:46,816 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-08 13:41:46,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:41:46,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:41:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash 196113914, now seen corresponding path program 1 times [2025-03-08 13:41:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:41:46,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768666210] [2025-03-08 13:41:46,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:41:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:41:46,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 13:41:46,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 13:41:46,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:41:46,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:41:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 13:41:47,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:41:47,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768666210] [2025-03-08 13:41:47,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768666210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:41:47,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:41:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:41:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152990804] [2025-03-08 13:41:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:41:47,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:41:47,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:41:47,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:41:47,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:41:47,032 INFO L87 Difference]: Start difference. First operand 69 states and 101 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:41:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:41:47,069 INFO L93 Difference]: Finished difference Result 157 states and 228 transitions. [2025-03-08 13:41:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:41:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 155 [2025-03-08 13:41:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:41:47,075 INFO L225 Difference]: With dead ends: 157 [2025-03-08 13:41:47,075 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 13:41:47,075 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-08 13:41:47,076 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 25 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:41:47,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 197 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:41:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 13:41:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2025-03-08 13:41:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 13:41:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2025-03-08 13:41:47,093 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 155 [2025-03-08 13:41:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:41:47,094 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2025-03-08 13:41:47,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:41:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2025-03-08 13:41:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 13:41:47,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:41:47,097 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:41:47,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:41:47,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:41:47,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:41:47,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1600837445, now seen corresponding path program 1 times [2025-03-08 13:41:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:41:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362399294] [2025-03-08 13:41:47,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:41:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:41:47,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 13:41:47,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 13:41:47,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:41:47,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:41:47,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:41:47,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 13:41:47,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 13:41:47,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:41:47,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:41:47,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:41:47,279 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:41:47,280 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:41:47,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:41:47,283 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 13:41:47,359 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:41:47,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:41:47 BoogieIcfgContainer [2025-03-08 13:41:47,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:41:47,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:41:47,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:41:47,362 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:41:47,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:46" (3/4) ... [2025-03-08 13:41:47,366 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:41:47,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:41:47,367 INFO L158 Benchmark]: Toolchain (without parser) took 2157.76ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 63.3MB in the end (delta: 66.0MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2025-03-08 13:41:47,367 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:41:47,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.63ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 114.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:41:47,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.55ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 110.2MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:41:47,368 INFO L158 Benchmark]: Boogie Preprocessor took 52.68ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 102.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:41:47,368 INFO L158 Benchmark]: IcfgBuilder took 438.69ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 79.3MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 13:41:47,368 INFO L158 Benchmark]: TraceAbstraction took 1358.03ms. Allocated memory is still 167.8MB. Free memory was 78.4MB in the beginning and 63.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2025-03-08 13:41:47,368 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 167.8MB. Free memory was 63.4MB in the beginning and 63.3MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:41:47,371 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 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.63ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 114.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.55ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 110.2MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.68ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 102.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 438.69ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 79.3MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1358.03ms. Allocated memory is still 167.8MB. Free memory was 78.4MB in the beginning and 63.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 167.8MB. Free memory was 63.4MB in the beginning and 63.3MB in the end (delta: 50.8kB). 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 84, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_3 = 2; [L25] signed short int var_1_4 = 256; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 2; [L28] float var_1_7 = 255.8; [L29] float var_1_8 = 127.8; [L30] float var_1_9 = 128.5; [L31] float var_1_10 = 499.3; [L32] unsigned short int var_1_11 = 10; [L33] unsigned char var_1_12 = 1; [L34] unsigned short int var_1_13 = 8; [L35] unsigned short int var_1_14 = 256; [L36] unsigned short int var_1_15 = 1; [L37] unsigned short int var_1_16 = 16; [L38] unsigned short int var_1_17 = 57705; [L39] unsigned long int var_1_18 = 64; VAL [isInitial=0, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L66] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L66] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L67] var_1_3 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_3 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L68] RET assume_abort_if_not(var_1_3 >= -16383) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L69] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L69] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L70] var_1_4 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_4 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L71] RET assume_abort_if_not(var_1_4 >= -8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L72] CALL assume_abort_if_not(var_1_4 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L72] RET assume_abort_if_not(var_1_4 <= 8192) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L73] var_1_5 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_5 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L74] RET assume_abort_if_not(var_1_5 >= -8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L75] CALL assume_abort_if_not(var_1_5 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L75] RET assume_abort_if_not(var_1_5 <= 8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L76] var_1_6 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L77] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L78] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L78] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L79] var_1_8 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_9=257/2] [L80] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5, var_1_9=257/2] [L81] var_1_9 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L82] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L83] var_1_10 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L84] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L87] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L87] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L88] var_1_13 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L90] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L90] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L91] var_1_14 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L92] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L93] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L93] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L94] var_1_15 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L96] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L96] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L97] var_1_16 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L99] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L99] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L100] var_1_17 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L101] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L102] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L102] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L115] RET updateVariables() [L116] CALL step() [L43] COND FALSE !(! var_1_2) [L46] var_1_1 = var_1_5 VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L48] signed short int stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=3, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767, var_1_7=1279/5] [L49] COND TRUE stepLocal_0 > 2 [L50] var_1_7 = ((var_1_8 + var_1_9) - var_1_10) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] [L52] var_1_18 = var_1_17 VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] [L53] COND TRUE var_1_2 && var_1_12 [L54] var_1_11 = (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))) VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR (((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((float) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15))))) VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] [L107-L108] return ((((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((float) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15)))))) && (var_1_18 == ((unsigned long int) var_1_17)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] [L19] reach_error() VAL [isInitial=1, var_1_11=65533, var_1_12=1, var_1_13=32767, var_1_14=32766, var_1_15=32765, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=3, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=3, var_1_6=-32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 131 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 209 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred 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, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3552/3600 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-08 13:41:47,392 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_floatingpointinfluence_has-floats_file-86.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 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:41:49,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:41:49,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:41:49,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:41:49,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:41:49,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:41:49,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:41:49,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:41:49,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:41:49,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:41:49,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:41:49,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:41:49,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:41:49,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:41:49,385 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:41:49,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:41:49,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:41:49,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:41:49,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:41:49,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:41:49,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:41:49,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:41:49,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:41:49,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:41:49,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:41:49,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:41:49,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:41:49,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:41:49,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:41:49,387 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:41:49,388 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:41:49,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:41:49,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:41:49,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:41:49,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:41:49,388 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 -> 03eb8d0594f660e397efb8ed7c8e04abe62220780abc754b35c25622af978718 [2025-03-08 13:41:49,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:41:49,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:41:49,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:41:49,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:41:49,644 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:41:49,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-08 13:41:50,874 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d384f9846/293ba48aafda4179b44de2f22655344c/FLAG6eff784ff [2025-03-08 13:41:51,081 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:41:51,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-08 13:41:51,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d384f9846/293ba48aafda4179b44de2f22655344c/FLAG6eff784ff [2025-03-08 13:41:51,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d384f9846/293ba48aafda4179b44de2f22655344c [2025-03-08 13:41:51,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:41:51,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:41:51,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:41:51,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:41:51,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:41:51,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9be0c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51, skipping insertion in model container [2025-03-08 13:41:51,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:41:51,242 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_floatingpointinfluence_has-floats_file-86.i[917,930] [2025-03-08 13:41:51,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:41:51,316 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:41:51,325 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_floatingpointinfluence_has-floats_file-86.i[917,930] [2025-03-08 13:41:51,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:41:51,360 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:41:51,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51 WrapperNode [2025-03-08 13:41:51,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:41:51,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:41:51,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:41:51,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:41:51,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,406 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-08 13:41:51,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:41:51,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:41:51,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:41:51,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:41:51,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,436 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-08 13:41:51,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:41:51,457 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:41:51,457 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:41:51,457 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:41:51,458 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (1/1) ... [2025-03-08 13:41:51,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:41:51,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:41:51,484 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-08 13:41:51,489 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-08 13:41:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:41:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:41:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:41:51,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:41:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:41:51,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:41:51,571 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:41:51,573 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:41:52,251 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 13:41:52,251 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:41:52,259 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:41:52,259 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:41:52,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:52 BoogieIcfgContainer [2025-03-08 13:41:52,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:41:52,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:41:52,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:41:52,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:41:52,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:41:51" (1/3) ... [2025-03-08 13:41:52,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cc1afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:41:52, skipping insertion in model container [2025-03-08 13:41:52,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:51" (2/3) ... [2025-03-08 13:41:52,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cc1afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:41:52, skipping insertion in model container [2025-03-08 13:41:52,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:52" (3/3) ... [2025-03-08 13:41:52,269 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-86.i [2025-03-08 13:41:52,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:41:52,283 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-86.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:41:52,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:41:52,357 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;@5262a79a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:41:52,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:41:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 13:41:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 13:41:52,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:41:52,373 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:41:52,373 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:41:52,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:41:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash -187873587, now seen corresponding path program 1 times [2025-03-08 13:41:52,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:41:52,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077379616] [2025-03-08 13:41:52,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:41:52,387 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-08 13:41:52,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:41:52,390 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-08 13:41:52,392 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-08 13:41:52,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 13:41:52,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 13:41:52,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:41:52,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:41:52,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:41:52,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:41:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-08 13:41:52,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:41:52,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:41:52,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077379616] [2025-03-08 13:41:52,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077379616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:41:52,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:41:52,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:41:52,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379063858] [2025-03-08 13:41:52,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:41:52,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:41:52,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:41:52,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:41:52,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:41:52,698 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 13:41:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:41:52,724 INFO L93 Difference]: Finished difference Result 120 states and 206 transitions. [2025-03-08 13:41:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:41:52,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 153 [2025-03-08 13:41:52,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:41:52,731 INFO L225 Difference]: With dead ends: 120 [2025-03-08 13:41:52,731 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 13:41:52,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-08 13:41:52,738 INFO L435 NwaCegarLoop]: 88 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, 88 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-08 13:41:52,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:41:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 13:41:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-08 13:41:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 13:41:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2025-03-08 13:41:52,794 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 153 [2025-03-08 13:41:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:41:52,794 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2025-03-08 13:41:52,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 13:41:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2025-03-08 13:41:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 13:41:52,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:41:52,798 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:41:52,806 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-08 13:41:52,998 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-08 13:41:52,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:41:52,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:41:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1556622352, now seen corresponding path program 1 times [2025-03-08 13:41:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:41:53,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486764251] [2025-03-08 13:41:53,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:41:53,000 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-08 13:41:53,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:41:53,003 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-08 13:41:53,004 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-08 13:41:53,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 13:41:53,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 13:41:53,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:41:53,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:41:53,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 13:41:53,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:41:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 13:41:53,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:41:53,301 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:41:53,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486764251] [2025-03-08 13:41:53,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486764251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:41:53,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:41:53,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:41:53,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565745644] [2025-03-08 13:41:53,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:41:53,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:41:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:41:53,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:41:53,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:41:53,304 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:41:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:41:53,648 INFO L93 Difference]: Finished difference Result 130 states and 189 transitions. [2025-03-08 13:41:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:41:53,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 153 [2025-03-08 13:41:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:41:53,656 INFO L225 Difference]: With dead ends: 130 [2025-03-08 13:41:53,656 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 13:41:53,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 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-08 13:41:53,657 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 13 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:41:53,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:41:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 13:41:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2025-03-08 13:41:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 13:41:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2025-03-08 13:41:53,665 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 153 [2025-03-08 13:41:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:41:53,666 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2025-03-08 13:41:53,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:41:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2025-03-08 13:41:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 13:41:53,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:41:53,669 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:41:53,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:41:53,870 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-08 13:41:53,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:41:53,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:41:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash 930890481, now seen corresponding path program 1 times [2025-03-08 13:41:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:41:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921730664] [2025-03-08 13:41:53,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:41:53,873 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-08 13:41:53,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:41:53,875 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-08 13:41:53,876 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-08 13:41:53,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 13:41:54,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 13:41:54,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:41:54,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:41:54,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 13:41:54,103 INFO L279 TraceCheckSpWp]: Computing forward predicates...