./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.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 ba06880449cc9eb48584427dad875518cd896e20dec3ed5b33045e3e8689f7a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:16:23,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:16:23,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:16:23,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:16:23,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:16:23,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:16:23,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:16:23,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:16:23,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:16:23,853 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:16:23,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:16:23,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:16:23,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:16:23,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:16:23,854 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:16:23,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:16:23,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:16:23,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:16:23,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:16:23,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:16:23,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:16:23,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:16:23,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:16:23,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:16:23,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:16:23,856 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:16:23,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:16:23,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:16:23,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:16:23,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:16:23,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:16:23,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:16:23,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:16:23,857 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 -> ba06880449cc9eb48584427dad875518cd896e20dec3ed5b33045e3e8689f7a3 [2025-03-08 12:16:24,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:16:24,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:16:24,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:16:24,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:16:24,103 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:16:24,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-08 12:16:25,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693f88f40/034dcde54bb44535b5b7ddb9e89dfb41/FLAGcb08e23cb [2025-03-08 12:16:25,509 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:16:25,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-08 12:16:25,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693f88f40/034dcde54bb44535b5b7ddb9e89dfb41/FLAGcb08e23cb [2025-03-08 12:16:25,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693f88f40/034dcde54bb44535b5b7ddb9e89dfb41 [2025-03-08 12:16:25,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:16:25,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:16:25,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:16:25,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:16:25,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:16:25,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:16:25" (1/1) ... [2025-03-08 12:16:25,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfb141b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:25, skipping insertion in model container [2025-03-08 12:16:25,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:16:25" (1/1) ... [2025-03-08 12:16:25,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:16:25,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i[918,931] [2025-03-08 12:16:26,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:16:26,051 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:16:26,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i[918,931] [2025-03-08 12:16:26,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:16:26,111 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:16:26,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26 WrapperNode [2025-03-08 12:16:26,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:16:26,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:16:26,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:16:26,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:16:26,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,172 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-03-08 12:16:26,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:16:26,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:16:26,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:16:26,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:16:26,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,206 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:16:26,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:16:26,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:16:26,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:16:26,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:16:26,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (1/1) ... [2025-03-08 12:16:26,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:16:26,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:16:26,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:16:26,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:16:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:16:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:16:26,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:16:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:16:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:16:26,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:16:26,345 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:16:26,347 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:16:26,646 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 12:16:26,647 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:16:26,663 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:16:26,664 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 12:16:26,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:16:26 BoogieIcfgContainer [2025-03-08 12:16:26,665 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:16:26,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:16:26,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:16:26,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:16:26,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:16:25" (1/3) ... [2025-03-08 12:16:26,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533e96e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:16:26, skipping insertion in model container [2025-03-08 12:16:26,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:26" (2/3) ... [2025-03-08 12:16:26,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533e96e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:16:26, skipping insertion in model container [2025-03-08 12:16:26,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:16:26" (3/3) ... [2025-03-08 12:16:26,674 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-08 12:16:26,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:16:26,688 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:16:26,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:16:26,752 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;@2e36c832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:16:26,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:16:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 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-08 12:16:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 12:16:26,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:26,767 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, 1] [2025-03-08 12:16:26,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:26,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:26,773 INFO L85 PathProgramCache]: Analyzing trace with hash -263817293, now seen corresponding path program 1 times [2025-03-08 12:16:26,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:26,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73979141] [2025-03-08 12:16:26,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:26,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:16:26,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:16:26,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:26,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:27,043 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-08 12:16:27,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:27,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73979141] [2025-03-08 12:16:27,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73979141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:16:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750242081] [2025-03-08 12:16:27,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:27,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:16:27,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:16:27,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:16:27,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:16:27,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:16:27,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:16:27,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:27,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:27,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:16:27,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:16:27,215 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-08 12:16:27,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:16:27,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750242081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:27,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:16:27,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:16:27,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596218528] [2025-03-08 12:16:27,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:27,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:16:27,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:27,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:16:27,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:16:27,238 INFO L87 Difference]: Start difference. First operand has 73 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 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) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-08 12:16:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:27,259 INFO L93 Difference]: Finished difference Result 140 states and 240 transitions. [2025-03-08 12:16:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:16:27,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 132 [2025-03-08 12:16:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:27,266 INFO L225 Difference]: With dead ends: 140 [2025-03-08 12:16:27,266 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 12:16:27,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:16:27,270 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:27,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:16:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 12:16:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-08 12:16:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 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-08 12:16:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2025-03-08 12:16:27,305 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 132 [2025-03-08 12:16:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:27,305 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2025-03-08 12:16:27,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-08 12:16:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2025-03-08 12:16:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 12:16:27,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:27,310 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, 1] [2025-03-08 12:16:27,317 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-08 12:16:27,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:16:27,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:27,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1192239535, now seen corresponding path program 1 times [2025-03-08 12:16:27,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:27,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111686913] [2025-03-08 12:16:27,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:27,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:27,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:16:27,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:16:27,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:27,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:27,701 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-08 12:16:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:27,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111686913] [2025-03-08 12:16:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111686913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:27,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:16:27,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:16:27,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413034617] [2025-03-08 12:16:27,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:27,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:16:27,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:27,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:16:27,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:16:27,703 INFO L87 Difference]: Start difference. First operand 70 states and 107 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-08 12:16:27,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:27,752 INFO L93 Difference]: Finished difference Result 173 states and 261 transitions. [2025-03-08 12:16:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:16:27,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 132 [2025-03-08 12:16:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:27,758 INFO L225 Difference]: With dead ends: 173 [2025-03-08 12:16:27,759 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 12:16:27,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:16:27,760 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 49 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:27,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 240 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:16:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 12:16:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2025-03-08 12:16:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 69 states have internal predecessors, (89), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:16:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 153 transitions. [2025-03-08 12:16:27,783 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 153 transitions. Word has length 132 [2025-03-08 12:16:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:27,784 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 153 transitions. [2025-03-08 12:16:27,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-08 12:16:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 153 transitions. [2025-03-08 12:16:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 12:16:27,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:27,785 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, 1] [2025-03-08 12:16:27,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:16:27,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:27,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1359917426, now seen corresponding path program 1 times [2025-03-08 12:16:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:27,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727529432] [2025-03-08 12:16:27,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:27,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:16:27,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:16:27,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:27,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:28,852 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-08 12:16:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:28,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727529432] [2025-03-08 12:16:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727529432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:16:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:16:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493790482] [2025-03-08 12:16:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:28,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:16:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:28,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:16:28,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:16:28,855 INFO L87 Difference]: Start difference. First operand 103 states and 153 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (19), 1 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-08 12:16:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:29,289 INFO L93 Difference]: Finished difference Result 316 states and 471 transitions. [2025-03-08 12:16:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:16:29,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (19), 1 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 132 [2025-03-08 12:16:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:29,297 INFO L225 Difference]: With dead ends: 316 [2025-03-08 12:16:29,298 INFO L226 Difference]: Without dead ends: 216 [2025-03-08 12:16:29,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:16:29,299 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 296 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:29,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 357 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:16:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-08 12:16:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 160. [2025-03-08 12:16:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 106 states have internal predecessors, (140), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 12:16:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2025-03-08 12:16:29,327 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 132 [2025-03-08 12:16:29,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:29,328 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2025-03-08 12:16:29,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (19), 1 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-08 12:16:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2025-03-08 12:16:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 12:16:29,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:29,330 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, 1] [2025-03-08 12:16:29,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:16:29,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:29,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1138098511, now seen corresponding path program 1 times [2025-03-08 12:16:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:29,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822566358] [2025-03-08 12:16:29,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:29,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:16:29,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:16:29,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:29,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:16:29,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [785006411] [2025-03-08 12:16:29,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:29,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:16:29,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:16:29,451 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-08 12:16:29,453 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-08 12:16:29,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:16:29,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:16:29,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:29,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:16:29,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:16:29,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:16:29,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:16:29,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:29,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:16:30,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:16:30,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:16:30,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:16:30,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:16:30,259 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,SelfDestructingSolverStorable3 [2025-03-08 12:16:30,262 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 12:16:30,349 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:16:30,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:16:30 BoogieIcfgContainer [2025-03-08 12:16:30,353 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:16:30,354 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:16:30,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:16:30,354 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:16:30,355 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:16:26" (3/4) ... [2025-03-08 12:16:30,356 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:16:30,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:16:30,358 INFO L158 Benchmark]: Toolchain (without parser) took 4520.08ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 110.5MB in the beginning and 167.2MB in the end (delta: -56.7MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. [2025-03-08 12:16:30,358 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:16:30,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.91ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 95.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:16:30,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.26ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 90.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:16:30,359 INFO L158 Benchmark]: Boogie Preprocessor took 51.86ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 84.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:16:30,359 INFO L158 Benchmark]: IcfgBuilder took 439.21ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 57.1MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:16:30,359 INFO L158 Benchmark]: TraceAbstraction took 3686.29ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 57.1MB in the beginning and 167.2MB in the end (delta: -110.1MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2025-03-08 12:16:30,359 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 310.4MB. Free memory was 167.2MB in the beginning and 167.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:16:30,360 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.24ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.91ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 95.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.26ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 90.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.86ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 84.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 439.21ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 57.1MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3686.29ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 57.1MB in the beginning and 167.2MB in the end (delta: -110.1MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 310.4MB. Free memory was 167.2MB in the beginning and 167.2MB in the end (delta: 41.6kB). 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 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 146. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 1; [L25] unsigned long int var_1_6 = 5; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 64; [L28] unsigned char var_1_11 = 64; [L29] unsigned short int var_1_12 = 25; [L30] unsigned short int var_1_14 = 31408; [L31] double var_1_15 = 64.375; [L32] double var_1_16 = 10.85; [L33] double var_1_17 = 128.8; [L34] double var_1_18 = 2.6; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed short int var_1_21 = -64; [L38] signed long int var_1_22 = -32; [L39] signed char var_1_26 = 25; [L40] signed char var_1_27 = 4; [L41] unsigned long int var_1_28 = 32; [L42] signed short int var_1_30 = 5; [L43] unsigned long int var_1_32 = 4; [L44] float var_1_34 = 31.25; [L45] double var_1_39 = 7.4; [L46] signed long int var_1_44 = 25; [L47] unsigned short int last_1_var_1_12 = 25; [L48] double last_1_var_1_15 = 64.375; VAL [isInitial=0, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L170] isInitial = 1 [L171] FCALL initially() [L172] COND TRUE 1 [L173] CALL updateLastVariables() [L162] last_1_var_1_12 = var_1_12 [L163] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L173] RET updateLastVariables() [L174] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=1, var_1_6=5, var_1_9=0] [L131] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=1, var_1_6=5, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=1, var_1_6=5, var_1_9=0] [L132] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=1, var_1_6=5, var_1_9=0] [L133] var_1_5 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_6=5, var_1_9=0] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_6=5, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L135] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L136] var_1_10 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L137] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L138] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L140] RET assume_abort_if_not(var_1_11 >= 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L141] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L142] var_1_14 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L143] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L144] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L145] var_1_16 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L146] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L147] var_1_17 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L148] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L150] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L151] var_1_20 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L152] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L153] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=25, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L154] var_1_26 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_26 >= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L155] RET assume_abort_if_not(var_1_26 >= 16) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_26 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L156] RET assume_abort_if_not(var_1_26 <= 32) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=4, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L157] var_1_27 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L158] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_27 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L159] RET assume_abort_if_not(var_1_27 <= 16) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L174] RET updateVariables() [L175] CALL step() [L52] COND FALSE !(last_1_var_1_12 > var_1_4) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L57] COND FALSE !(((- 64) + var_1_6) == var_1_6) [L60] var_1_1 = (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=5, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L62] COND TRUE var_1_17 == ((((32.5) < (var_1_15)) ? (32.5) : (var_1_15))) [L63] var_1_30 = var_1_27 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L73] COND TRUE var_1_5 == (var_1_6 / var_1_4) [L74] var_1_9 = ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=37/5, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L78] COND FALSE !(-256 < (var_1_6 * 10)) [L83] var_1_39 = var_1_16 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=-64, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L85] var_1_21 = var_1_10 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=32, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L86] COND TRUE 8.4 <= var_1_15 [L87] var_1_28 = (((((((var_1_5) < (var_1_1)) ? (var_1_5) : (var_1_1))) < 0 ) ? -((((var_1_5) < (var_1_1)) ? (var_1_5) : (var_1_1))) : ((((var_1_5) < (var_1_1)) ? (var_1_5) : (var_1_1))))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L91] unsigned long int stepLocal_3 = var_1_6; [L92] unsigned char stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_2=127, stepLocal_3=5, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L93] COND FALSE !(stepLocal_2 < var_1_1) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L98] EXPR ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) >> (var_1_26 - var_1_27) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=-32, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L98] COND FALSE !(var_1_4 <= (((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) >> (var_1_26 - var_1_27))) [L101] var_1_22 = var_1_4 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=127, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L103] unsigned long int stepLocal_0 = (((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_0=127, stepLocal_3=5, var_1_10=-193, var_1_11=64, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=127, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L104] COND TRUE ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= stepLocal_0 [L105] var_1_12 = ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=-193, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=127, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L109] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=-193, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=127, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=25, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L112] var_1_44 = var_1_4 [L113] signed long int stepLocal_1 = ~ (var_1_5 * var_1_1); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_1=-1, stepLocal_3=5, var_1_10=-193, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=515/8, var_1_16=2, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=127, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=127, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L114] COND TRUE stepLocal_1 <= var_1_12 [L115] var_1_15 = (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=-193, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=3, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=127, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=127, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L119] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=-193, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=3, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=127, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=127, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L175] RET step() [L176] CALL, EXPR property() [L166-L167] return (((((((((- 64) + var_1_6) == var_1_6) ? (var_1_1 == ((unsigned char) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - var_1_5))) : (var_1_1 == ((unsigned char) (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64)))) && ((last_1_var_1_12 > var_1_4) ? (((- last_1_var_1_15) < last_1_var_1_15) ? (var_1_6 == ((unsigned long int) 10u)) : 1) : 1)) && ((var_1_5 == (var_1_6 / var_1_4)) ? (var_1_9 == ((unsigned char) ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) : (var_1_9 == ((unsigned char) ((var_1_10 + var_1_11) - var_1_5))))) && ((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= ((((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)))) ? (var_1_12 == ((unsigned short int) ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_12 == ((unsigned short int) var_1_6)))) && (((~ (var_1_5 * var_1_1)) <= var_1_12) ? (var_1_15 == ((double) (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))))) : (var_1_15 == ((double) ((((((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) < (var_1_18)) ? (((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) : (var_1_18))))))) && ((var_1_4 < var_1_1) ? ((var_1_6 > var_1_21) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_21 == ((signed short int) var_1_10)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=3, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=127, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=127, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L176] RET, EXPR property() [L176] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=3, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=127, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=127, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=-193, var_1_11=64, var_1_12=16388, var_1_14=16383, var_1_15=3, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=63, var_1_20=256, var_1_21=63, var_1_22=127, var_1_26=16, var_1_27=16, var_1_28=0, var_1_30=16, var_1_32=4, var_1_34=125/4, var_1_39=2, var_1_44=127, var_1_4=127, var_1_5=-256, var_1_6=5, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 132 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 703 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 363 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 340 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=3, InterpolantAutomatonStates: 12, 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, 59 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 524 ConstructedInterpolants, 0 QuantifiedInterpolants, 1583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 327 ConjunctsInSsa, 1 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-08 12:16:30,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.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 ba06880449cc9eb48584427dad875518cd896e20dec3ed5b33045e3e8689f7a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:16:32,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:16:32,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:16:32,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:16:32,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:16:32,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:16:32,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:16:32,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:16:32,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:16:32,423 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:16:32,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:16:32,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:16:32,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:16:32,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:16:32,425 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:16:32,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:16:32,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:16:32,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:16:32,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:16:32,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:16:32,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:16:32,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:16:32,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:16:32,426 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:16:32,426 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:16:32,426 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:16:32,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:16:32,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:16:32,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:16:32,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:16:32,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:16:32,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:16:32,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:16:32,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:16:32,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:16:32,428 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 -> ba06880449cc9eb48584427dad875518cd896e20dec3ed5b33045e3e8689f7a3 [2025-03-08 12:16:32,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:16:32,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:16:32,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:16:32,692 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:16:32,693 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:16:32,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-08 12:16:33,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2524ba537/f825a60bf1354169a2fa6526cae3e2d4/FLAG172e2588d [2025-03-08 12:16:34,158 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:16:34,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-08 12:16:34,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2524ba537/f825a60bf1354169a2fa6526cae3e2d4/FLAG172e2588d [2025-03-08 12:16:34,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2524ba537/f825a60bf1354169a2fa6526cae3e2d4 [2025-03-08 12:16:34,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:16:34,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:16:34,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:16:34,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:16:34,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:16:34,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae1710c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34, skipping insertion in model container [2025-03-08 12:16:34,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:16:34,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i[918,931] [2025-03-08 12:16:34,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:16:34,417 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:16:34,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i[918,931] [2025-03-08 12:16:34,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:16:34,486 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:16:34,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34 WrapperNode [2025-03-08 12:16:34,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:16:34,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:16:34,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:16:34,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:16:34,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,533 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2025-03-08 12:16:34,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:16:34,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:16:34,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:16:34,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:16:34,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,565 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:16:34,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:16:34,591 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:16:34,591 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:16:34,591 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:16:34,592 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (1/1) ... [2025-03-08 12:16:34,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:16:34,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:16:34,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:16:34,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:16:34,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:16:34,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:16:34,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:16:34,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:16:34,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:16:34,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:16:34,706 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:16:34,708 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:16:35,507 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 12:16:35,507 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:16:35,518 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:16:35,519 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:16:35,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:16:35 BoogieIcfgContainer [2025-03-08 12:16:35,519 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:16:35,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:16:35,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:16:35,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:16:35,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:16:34" (1/3) ... [2025-03-08 12:16:35,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607411cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:16:35, skipping insertion in model container [2025-03-08 12:16:35,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:34" (2/3) ... [2025-03-08 12:16:35,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607411cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:16:35, skipping insertion in model container [2025-03-08 12:16:35,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:16:35" (3/3) ... [2025-03-08 12:16:35,529 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i [2025-03-08 12:16:35,544 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:16:35,546 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-5.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:16:35,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:16:35,605 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;@d098e0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:16:35,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:16:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 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-08 12:16:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:16:35,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:35,622 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-08 12:16:35,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:35,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash 441722967, now seen corresponding path program 1 times [2025-03-08 12:16:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:16:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582996552] [2025-03-08 12:16:35,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:35,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:16:35,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:16:35,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:16:35,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:16:35,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:16:35,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:16:35,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:35,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:35,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:16:35,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:16:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 12:16:35,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:16:35,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:16:35,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582996552] [2025-03-08 12:16:35,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582996552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:35,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:16:35,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:16:35,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261171655] [2025-03-08 12:16:35,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:35,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:16:35,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:16:35,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:16:35,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:16:35,971 INFO L87 Difference]: Start difference. First operand has 71 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-08 12:16:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:35,992 INFO L93 Difference]: Finished difference Result 136 states and 234 transitions. [2025-03-08 12:16:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:16:35,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (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 131 [2025-03-08 12:16:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:35,998 INFO L225 Difference]: With dead ends: 136 [2025-03-08 12:16:35,998 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 12:16:36,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:16:36,006 INFO L435 NwaCegarLoop]: 104 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, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:36,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:16:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 12:16:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-08 12:16:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 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-08 12:16:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-03-08 12:16:36,039 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 131 [2025-03-08 12:16:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:36,040 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-03-08 12:16:36,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (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-08 12:16:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-03-08 12:16:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:16:36,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:36,042 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-08 12:16:36,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 12:16:36,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:16:36,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:36,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:36,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1458523867, now seen corresponding path program 1 times [2025-03-08 12:16:36,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:16:36,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060235122] [2025-03-08 12:16:36,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:36,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:16:36,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:16:36,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:16:36,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:16:36,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:16:36,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:16:36,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:36,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:36,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:16:36,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:16:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-08 12:16:36,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:16:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 12:16:36,906 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:16:36,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060235122] [2025-03-08 12:16:36,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060235122] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:16:36,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:16:36,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 12:16:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458899959] [2025-03-08 12:16:36,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:16:36,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:16:36,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:16:36,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:16:36,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:16:36,909 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 12:16:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:37,554 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2025-03-08 12:16:37,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:16:37,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 131 [2025-03-08 12:16:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:37,569 INFO L225 Difference]: With dead ends: 139 [2025-03-08 12:16:37,569 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 12:16:37,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:16:37,570 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 96 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:37,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 181 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:16:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 12:16:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2025-03-08 12:16:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.3125) internal successors, (63), 48 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-08 12:16:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2025-03-08 12:16:37,581 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 131 [2025-03-08 12:16:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:37,582 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2025-03-08 12:16:37,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 12:16:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2025-03-08 12:16:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:16:37,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:37,583 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-08 12:16:37,596 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-08 12:16:37,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:16:37,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:37,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1093633094, now seen corresponding path program 1 times [2025-03-08 12:16:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:16:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223205934] [2025-03-08 12:16:37,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:37,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:16:37,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:16:37,789 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:16:37,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:16:37,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:16:37,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:16:37,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:37,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:37,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 12:16:37,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:16:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:16:38,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:16:38,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:16:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223205934] [2025-03-08 12:16:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223205934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:16:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [421502425] [2025-03-08 12:16:38,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:38,774 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:16:38,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:16:38,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:16:38,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 12:16:38,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:16:39,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:16:39,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:39,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:39,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:16:39,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:16:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:16:40,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:16:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [421502425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:16:40,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:16:40,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-08 12:16:40,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650752361] [2025-03-08 12:16:40,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:16:40,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:16:40,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:16:40,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:16:40,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:16:40,254 INFO L87 Difference]: Start difference. First operand 70 states and 101 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 12:16:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:40,897 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2025-03-08 12:16:40,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:16:40,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2025-03-08 12:16:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:40,900 INFO L225 Difference]: With dead ends: 211 [2025-03-08 12:16:40,900 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 12:16:40,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:16:40,904 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 58 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:40,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 236 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:16:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 12:16:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2025-03-08 12:16:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 94 states have internal predecessors, (121), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 12:16:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 197 transitions. [2025-03-08 12:16:40,924 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 197 transitions. Word has length 131 [2025-03-08 12:16:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:40,924 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 197 transitions. [2025-03-08 12:16:40,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 12:16:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 197 transitions. [2025-03-08 12:16:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:16:40,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:40,928 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-08 12:16:40,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:16:41,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-08 12:16:41,328 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 12:16:41,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:41,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:41,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1404382843, now seen corresponding path program 1 times [2025-03-08 12:16:41,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:16:41,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271305655] [2025-03-08 12:16:41,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:41,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:16:41,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:16:41,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:16:41,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 12:16:41,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:16:41,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:16:41,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:41,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:41,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 12:16:41,532 INFO L279 TraceCheckSpWp]: Computing forward predicates...