./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.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 d4502a09464b29bf00952bf3323a73b5690388bf06e82f0cd90fbd1bfdf0148c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:54:31,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:54:31,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:54:31,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:54:31,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:54:31,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:54:31,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:54:31,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:54:31,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:54:31,741 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:54:31,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:54:31,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:54:31,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:54:31,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:54:31,742 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:54:31,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:54:31,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:54:31,742 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:54:31,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:54:31,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:54:31,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:54:31,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:54:31,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:54:31,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:54:31,744 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:54:31,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:54:31,744 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:54:31,744 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:54:31,744 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:54:31,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:54:31,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:54:31,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:54:31,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:54:31,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:54:31,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:54:31,745 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:54:31,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:54:31,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:54:31,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:54:31,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:54:31,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:54:31,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:54:31,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:54:31,745 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 -> d4502a09464b29bf00952bf3323a73b5690388bf06e82f0cd90fbd1bfdf0148c [2025-03-17 01:54:31,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:54:31,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:54:31,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:54:31,972 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:54:31,972 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:54:31,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-17 01:54:33,166 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e53d57bd1/c9011b668b9146d9be76c6705411595a/FLAGf59d53daa [2025-03-17 01:54:33,432 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:54:33,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-17 01:54:33,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e53d57bd1/c9011b668b9146d9be76c6705411595a/FLAGf59d53daa [2025-03-17 01:54:33,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e53d57bd1/c9011b668b9146d9be76c6705411595a [2025-03-17 01:54:33,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:54:33,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:54:33,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:54:33,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:54:33,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:54:33,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:33,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33, skipping insertion in model container [2025-03-17 01:54:33,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:33,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:54:33,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i[918,931] [2025-03-17 01:54:33,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:54:33,922 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:54:33,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i[918,931] [2025-03-17 01:54:33,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:54:33,964 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:54:33,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33 WrapperNode [2025-03-17 01:54:33,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:54:33,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:54:33,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:54:33,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:54:33,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:33,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,006 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-03-17 01:54:34,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:54:34,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:54:34,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:54:34,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:54:34,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,025 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:54:34,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:54:34,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:54:34,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:54:34,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:54:34,043 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (1/1) ... [2025-03-17 01:54:34,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:54:34,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:54:34,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:54:34,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:54:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:54:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:54:34,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:54:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:54:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:54:34,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:54:34,169 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:54:34,171 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:54:34,493 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 01:54:34,493 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:54:34,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:54:34,512 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:54:34,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:54:34 BoogieIcfgContainer [2025-03-17 01:54:34,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:54:34,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:54:34,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:54:34,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:54:34,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:54:33" (1/3) ... [2025-03-17 01:54:34,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb2974c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:54:34, skipping insertion in model container [2025-03-17 01:54:34,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:33" (2/3) ... [2025-03-17 01:54:34,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb2974c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:54:34, skipping insertion in model container [2025-03-17 01:54:34,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:54:34" (3/3) ... [2025-03-17 01:54:34,524 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-17 01:54:34,536 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:54:34,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:54:34,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:54:34,597 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;@db6efba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:54:34,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:54:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 52 states have internal predecessors, (80), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:54:34,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 01:54:34,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:54:34,612 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:54:34,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:54:34,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:54:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash -454041216, now seen corresponding path program 1 times [2025-03-17 01:54:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:54:34,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27763768] [2025-03-17 01:54:34,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:54:34,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:54:34,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:54:34,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:54:34,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:54:34,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:54:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 01:54:34,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:54:34,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27763768] [2025-03-17 01:54:34,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27763768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:54:34,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248803954] [2025-03-17 01:54:34,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:54:34,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:54:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:54:34,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:54:34,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:54:34,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:54:35,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:54:35,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:54:35,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:54:35,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:54:35,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:54:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 01:54:35,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:54:35,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248803954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:54:35,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:54:35,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:54:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546471207] [2025-03-17 01:54:35,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:54:35,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:54:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:54:35,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:54:35,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:54:35,072 INFO L87 Difference]: Start difference. First operand has 73 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 52 states have internal predecessors, (80), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:54:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:54:35,094 INFO L93 Difference]: Finished difference Result 143 states and 253 transitions. [2025-03-17 01:54:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:54:35,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 128 [2025-03-17 01:54:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:54:35,101 INFO L225 Difference]: With dead ends: 143 [2025-03-17 01:54:35,101 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 01:54:35,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:54:35,109 INFO L435 NwaCegarLoop]: 110 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, 110 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-17 01:54:35,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:54:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 01:54:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 01:54:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:54:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 112 transitions. [2025-03-17 01:54:35,171 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 112 transitions. Word has length 128 [2025-03-17 01:54:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:54:35,172 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 112 transitions. [2025-03-17 01:54:35,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:54:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 112 transitions. [2025-03-17 01:54:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 01:54:35,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:54:35,176 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:54:35,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:54:35,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:54:35,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:54:35,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:54:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash -148766684, now seen corresponding path program 1 times [2025-03-17 01:54:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:54:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789955574] [2025-03-17 01:54:35,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:54:35,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:54:35,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 01:54:35,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 01:54:35,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:54:35,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:54:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:54:35,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:54:35,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789955574] [2025-03-17 01:54:35,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789955574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:54:35,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:54:35,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:54:35,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448570883] [2025-03-17 01:54:35,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:54:35,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:54:35,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:54:35,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:54:35,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:54:35,644 INFO L87 Difference]: Start difference. First operand 71 states and 112 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:54:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:54:35,676 INFO L93 Difference]: Finished difference Result 142 states and 225 transitions. [2025-03-17 01:54:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:54:35,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 129 [2025-03-17 01:54:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:54:35,679 INFO L225 Difference]: With dead ends: 142 [2025-03-17 01:54:35,679 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 01:54:35,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:54:35,680 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:54:35,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:54:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 01:54:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 01:54:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:54:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 113 transitions. [2025-03-17 01:54:35,690 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 113 transitions. Word has length 129 [2025-03-17 01:54:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:54:35,693 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 113 transitions. [2025-03-17 01:54:35,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:54:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 113 transitions. [2025-03-17 01:54:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 01:54:35,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:54:35,695 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:54:35,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:54:35,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:54:35,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:54:35,698 INFO L85 PathProgramCache]: Analyzing trace with hash 356791941, now seen corresponding path program 1 times [2025-03-17 01:54:35,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:54:35,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916518288] [2025-03-17 01:54:35,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:54:35,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:54:35,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 01:54:35,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 01:54:35,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:54:35,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:54:35,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039528367] [2025-03-17 01:54:35,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:54:35,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:54:35,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:54:35,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:54:35,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 01:54:35,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 01:54:36,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 01:54:36,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:54:36,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:54:36,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:54:36,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:54:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-17 01:54:36,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:54:36,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:54:36,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916518288] [2025-03-17 01:54:36,318 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 01:54:36,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039528367] [2025-03-17 01:54:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039528367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:54:36,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:54:36,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:54:36,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87483218] [2025-03-17 01:54:36,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:54:36,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:54:36,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:54:36,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:54:36,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:54:36,319 INFO L87 Difference]: Start difference. First operand 72 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:54:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:54:36,493 INFO L93 Difference]: Finished difference Result 182 states and 281 transitions. [2025-03-17 01:54:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:54:36,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 129 [2025-03-17 01:54:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:54:36,495 INFO L225 Difference]: With dead ends: 182 [2025-03-17 01:54:36,495 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 01:54:36,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:54:36,496 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 155 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:54:36,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 163 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:54:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 01:54:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2025-03-17 01:54:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 01:54:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 166 transitions. [2025-03-17 01:54:36,519 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 166 transitions. Word has length 129 [2025-03-17 01:54:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:54:36,519 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 166 transitions. [2025-03-17 01:54:36,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:54:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 166 transitions. [2025-03-17 01:54:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 01:54:36,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:54:36,524 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:54:36,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 01:54:36,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 01:54:36,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:54:36,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:54:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash -140087294, now seen corresponding path program 1 times [2025-03-17 01:54:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:54:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980181236] [2025-03-17 01:54:36,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:54:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:54:36,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 01:54:36,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 01:54:36,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:54:36,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:54:36,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406349865] [2025-03-17 01:54:36,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:54:36,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:54:36,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:54:36,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:54:36,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 01:54:36,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 01:54:37,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 01:54:37,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:54:37,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:54:37,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:54:37,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 01:54:37,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 01:54:37,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:54:37,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:54:37,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:54:37,296 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:54:37,297 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:54:37,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 01:54:37,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:54:37,502 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 01:54:37,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:54:37,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:54:37 BoogieIcfgContainer [2025-03-17 01:54:37,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:54:37,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:54:37,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:54:37,582 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:54:37,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:54:34" (3/4) ... [2025-03-17 01:54:37,584 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:54:37,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:54:37,585 INFO L158 Benchmark]: Toolchain (without parser) took 3841.53ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 69.3MB in the end (delta: 52.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2025-03-17 01:54:37,585 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:54:37,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.33ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 107.1MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:54:37,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.89ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 104.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:54:37,586 INFO L158 Benchmark]: Boogie Preprocessor took 34.77ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 100.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:54:37,586 INFO L158 Benchmark]: IcfgBuilder took 470.89ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 77.7MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 01:54:37,586 INFO L158 Benchmark]: TraceAbstraction took 3064.83ms. Allocated memory is still 167.8MB. Free memory was 77.0MB in the beginning and 69.4MB in the end (delta: 7.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2025-03-17 01:54:37,586 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 167.8MB. Free memory was 69.4MB in the beginning and 69.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:54:37,589 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.52ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.33ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 107.1MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.89ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 104.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.77ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 100.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 470.89ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 77.7MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3064.83ms. Allocated memory is still 167.8MB. Free memory was 77.0MB in the beginning and 69.4MB in the end (delta: 7.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 167.8MB. Free memory was 69.4MB in the beginning and 69.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 73, overapproximation of someBinaryArithmeticDOUBLEoperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someUnaryDOUBLEoperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryArithmeticFLOAToperation at line 54, overapproximation of someBinaryArithmeticFLOAToperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] float var_1_22 = 256.5; [L40] signed char var_1_27 = -64; [L41] signed char var_1_30 = -10; [L42] unsigned long int var_1_31 = 8; [L43] double var_1_32 = 499.75; [L44] double var_1_36 = 3.15; [L45] unsigned char var_1_38 = 8; [L46] float var_1_40 = 255.8; [L47] signed short int var_1_41 = 256; [L48] signed char var_1_42 = -32; [L49] unsigned long int last_1_var_1_6 = 10000; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L166] last_1_var_1_6 = var_1_6 [L176] RET updateLastVariables() [L177] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L134] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L136] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L137] var_1_8 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L138] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L139] var_1_11 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L140] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L141] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L141] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L142] var_1_12 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L143] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L144] var_1_13 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L145] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L146] var_1_15 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L147] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L148] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L148] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L149] var_1_16 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L150] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L151] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L151] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L152] var_1_18 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L153] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L154] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L154] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L155] var_1_30 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L156] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L157] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L157] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L158] var_1_36 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L159] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L160] var_1_42 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_42 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L161] RET assume_abort_if_not(var_1_42 >= -128) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L162] CALL assume_abort_if_not(var_1_42 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L162] RET assume_abort_if_not(var_1_42 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L163] CALL assume_abort_if_not(var_1_42 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L163] RET assume_abort_if_not(var_1_42 != 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L177] RET updateVariables() [L178] CALL step() [L53] COND TRUE var_1_6 >= var_1_16 [L54] var_1_22 = (var_1_13 + var_1_13) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L56] COND FALSE !(((var_1_4 + 127.75f) * var_1_13) < var_1_13) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L61] COND FALSE !(var_1_20 < (~ var_1_30)) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L66] COND FALSE !(var_1_13 == var_1_13) [L73] var_1_32 = (((((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))) < 0 ) ? -((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))) : ((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L75] COND TRUE ! (var_1_4 <= var_1_36) [L76] var_1_38 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_38=5, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L78] EXPR (var_1_16 >> 4) & var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_38=5, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L78] COND TRUE 128 != ((var_1_16 >> 4) & var_1_16) [L79] var_1_40 = ((((var_1_36) > (var_1_4)) ? (var_1_36) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=256, var_1_42=-3, var_1_4=0, var_1_6=10000] [L81] COND TRUE (var_1_16 / var_1_42) < var_1_20 [L82] var_1_41 = ((((((((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) < 0 ) ? -((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) : ((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))))) < 0 ) ? -(((((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) < 0 ) ? -((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) : ((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))))) : (((((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) < 0 ) ? -((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) : ((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))))))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L86] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L87] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L89] COND TRUE (var_1_5 / var_1_11) >= (var_1_8 - var_1_4) [L90] var_1_10 = (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L94] var_1_20 = var_1_16 [L95] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L96] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L97] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L98] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L105] unsigned char stepLocal_0 = var_1_20 != var_1_20; VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L106] COND FALSE !(\read(var_1_17)) [L117] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=5] [L119] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=5] [L120] COND FALSE !(var_1_6 > var_1_6) [L123] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=6, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_5=6, var_1_6=5] [L128] COND TRUE var_1_1 < var_1_11 [L129] var_1_19 = (var_1_13 - 256.4) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_5=6, var_1_6=5] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_5=6, var_1_6=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=5, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_5=6, var_1_6=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 137 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 331 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 903 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 510 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 3 NumberOfNonLiveVariables, 641 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2700/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 01:54:37,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.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 d4502a09464b29bf00952bf3323a73b5690388bf06e82f0cd90fbd1bfdf0148c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:54:39,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:54:39,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:54:39,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:54:39,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:54:39,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:54:39,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:54:39,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:54:39,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:54:39,532 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:54:39,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:54:39,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:54:39,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:54:39,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:54:39,532 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:54:39,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:54:39,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:54:39,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:54:39,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:54:39,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:54:39,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:54:39,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:54:39,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:54:39,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:54:39,534 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:54:39,534 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:54:39,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:54:39,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:54:39,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:54:39,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:54:39,534 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 -> d4502a09464b29bf00952bf3323a73b5690388bf06e82f0cd90fbd1bfdf0148c [2025-03-17 01:54:39,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:54:39,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:54:39,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:54:39,782 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:54:39,782 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:54:39,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-17 01:54:41,039 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8ee128f1/f15809d84e5e433095236617d968f115/FLAG76e8978b1 [2025-03-17 01:54:41,250 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:54:41,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-17 01:54:41,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8ee128f1/f15809d84e5e433095236617d968f115/FLAG76e8978b1 [2025-03-17 01:54:41,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8ee128f1/f15809d84e5e433095236617d968f115 [2025-03-17 01:54:41,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:54:41,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:54:41,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:54:41,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:54:41,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:54:41,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d2cfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41, skipping insertion in model container [2025-03-17 01:54:41,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:54:41,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i[918,931] [2025-03-17 01:54:41,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:54:41,525 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:54:41,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i[918,931] [2025-03-17 01:54:41,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:54:41,624 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:54:41,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41 WrapperNode [2025-03-17 01:54:41,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:54:41,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:54:41,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:54:41,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:54:41,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,689 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-03-17 01:54:41,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:54:41,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:54:41,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:54:41,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:54:41,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,718 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:54:41,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:54:41,755 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:54:41,755 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:54:41,755 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:54:41,758 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (1/1) ... [2025-03-17 01:54:41,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:54:41,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:54:41,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:54:41,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:54:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:54:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:54:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:54:41,813 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:54:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:54:41,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:54:41,880 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:54:41,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:55:02,570 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 01:55:02,570 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:55:02,577 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:55:02,577 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:55:02,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:55:02 BoogieIcfgContainer [2025-03-17 01:55:02,578 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:55:02,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:55:02,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:55:02,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:55:02,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:54:41" (1/3) ... [2025-03-17 01:55:02,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f298196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:55:02, skipping insertion in model container [2025-03-17 01:55:02,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:41" (2/3) ... [2025-03-17 01:55:02,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f298196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:55:02, skipping insertion in model container [2025-03-17 01:55:02,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:55:02" (3/3) ... [2025-03-17 01:55:02,586 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-17 01:55:02,596 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:55:02,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:55:02,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:55:02,648 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;@2810afd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:55:02,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:55:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 46 states have internal predecessors, (70), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:55:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 01:55:02,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:55:02,660 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:55:02,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:55:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:55:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash 121568829, now seen corresponding path program 1 times [2025-03-17 01:55:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:55:02,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510840058] [2025-03-17 01:55:02,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:55:02,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:55:02,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:55:02,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:55:02,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 01:55:02,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 01:55:03,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 01:55:03,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:55:03,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:55:03,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:55:03,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:55:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-17 01:55:03,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:55:03,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:55:03,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510840058] [2025-03-17 01:55:03,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510840058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:55:03,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:55:03,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:55:03,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404162837] [2025-03-17 01:55:03,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:55:03,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:55:03,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:55:03,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:55:03,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:55:03,464 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 46 states have internal predecessors, (70), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:55:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:55:03,479 INFO L93 Difference]: Finished difference Result 131 states and 233 transitions. [2025-03-17 01:55:03,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:55:03,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2025-03-17 01:55:03,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:55:03,484 INFO L225 Difference]: With dead ends: 131 [2025-03-17 01:55:03,484 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 01:55:03,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:55:03,488 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:55:03,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:55:03,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 01:55:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 01:55:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 44 states have internal predecessors, (62), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:55:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 100 transitions. [2025-03-17 01:55:03,515 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 100 transitions. Word has length 127 [2025-03-17 01:55:03,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:55:03,515 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 100 transitions. [2025-03-17 01:55:03,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:55:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2025-03-17 01:55:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 01:55:03,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:55:03,517 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:55:03,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 01:55:03,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:55:03,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:55:03,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:55:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash 874526858, now seen corresponding path program 1 times [2025-03-17 01:55:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:55:03,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749479711] [2025-03-17 01:55:03,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:55:03,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:55:03,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:55:03,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:55:03,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 01:55:03,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:55:04,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:55:04,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:55:04,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:55:04,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:55:04,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:55:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 318 proven. 36 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-17 01:55:07,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:55:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:55:08,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:55:08,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749479711] [2025-03-17 01:55:08,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749479711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:55:08,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:55:08,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-17 01:55:08,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217763386] [2025-03-17 01:55:08,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:55:08,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:55:08,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:55:08,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:55:08,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:55:08,745 INFO L87 Difference]: Start difference. First operand 65 states and 100 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-17 01:55:12,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:55:16,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:55:20,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:55:24,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:55:29,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:55:33,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:55:37,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:55:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:55:37,259 INFO L93 Difference]: Finished difference Result 135 states and 204 transitions. [2025-03-17 01:55:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:55:37,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 128 [2025-03-17 01:55:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:55:37,338 INFO L225 Difference]: With dead ends: 135 [2025-03-17 01:55:37,338 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 01:55:37,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:55:37,339 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 97 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 20 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:55:37,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 167 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 28.2s Time] [2025-03-17 01:55:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 01:55:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-03-17 01:55:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:55:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2025-03-17 01:55:37,352 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 128 [2025-03-17 01:55:37,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:55:37,353 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 101 transitions. [2025-03-17 01:55:37,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-17 01:55:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2025-03-17 01:55:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 01:55:37,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:55:37,354 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:55:37,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 01:55:37,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:55:37,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:55:37,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:55:37,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1239139061, now seen corresponding path program 1 times [2025-03-17 01:55:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:55:37,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579281344] [2025-03-17 01:55:37,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:55:37,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:55:37,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:55:37,559 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:55:37,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 01:55:37,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 01:55:38,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 01:55:38,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:55:38,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:55:38,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:55:38,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:55:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 27 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-17 01:55:39,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:55:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:55:41,586 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:55:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579281344] [2025-03-17 01:55:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579281344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:55:41,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:55:41,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-17 01:55:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156046965] [2025-03-17 01:55:41,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:55:41,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:55:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:55:41,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:55:41,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:55:41,589 INFO L87 Difference]: Start difference. First operand 69 states and 101 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 01:55:46,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:55:50,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:55:54,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:55:58,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:55:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:55:59,796 INFO L93 Difference]: Finished difference Result 170 states and 240 transitions. [2025-03-17 01:55:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:55:59,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 130 [2025-03-17 01:55:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:55:59,803 INFO L225 Difference]: With dead ends: 170 [2025-03-17 01:55:59,803 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 01:55:59,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:55:59,804 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 151 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:55:59,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 201 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 254 Invalid, 3 Unknown, 0 Unchecked, 17.6s Time] [2025-03-17 01:55:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 01:55:59,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2025-03-17 01:55:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 01:55:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 134 transitions. [2025-03-17 01:55:59,819 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 134 transitions. Word has length 130 [2025-03-17 01:55:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:55:59,819 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 134 transitions. [2025-03-17 01:55:59,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 01:55:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 134 transitions. [2025-03-17 01:55:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 01:55:59,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:55:59,821 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:55:59,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 01:56:00,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:56:00,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:56:00,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:56:00,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1925659196, now seen corresponding path program 1 times [2025-03-17 01:56:00,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:56:00,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105677587] [2025-03-17 01:56:00,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:56:00,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:56:00,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:56:00,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:56:00,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 01:56:00,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:56:00,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:56:00,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:56:00,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:56:01,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 01:56:01,007 INFO L279 TraceCheckSpWp]: Computing forward predicates...