./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.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 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:52:19,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:52:19,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:52:19,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:52:19,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:52:19,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:52:19,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:52:19,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:52:19,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:52:19,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:52:19,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:52:19,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:52:19,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:52:19,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:52:19,673 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:52:19,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:52:19,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:52:19,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:52:19,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:52:19,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:52:19,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:52:19,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:52:19,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:52:19,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:52:19,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:52:19,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:52:19,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:52:19,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:52:19,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:52:19,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:52:19,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:52:19,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:52:19,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:52:19,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:52:19,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:52:19,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:52:19,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:52:19,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:52:19,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:52:19,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:52:19,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:52:19,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:52:19,685 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff [2024-11-12 04:52:20,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:52:20,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:52:20,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:52:20,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:52:20,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:52:20,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-11-12 04:52:21,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:52:21,754 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:52:21,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-11-12 04:52:21,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56ccb8eb/7e5f8dff5a5f48eb85014a3f888134ee/FLAG8720250eb [2024-11-12 04:52:21,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56ccb8eb/7e5f8dff5a5f48eb85014a3f888134ee [2024-11-12 04:52:21,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:52:21,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:52:21,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:52:21,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:52:21,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:52:21,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:52:21" (1/1) ... [2024-11-12 04:52:21,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd05586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:21, skipping insertion in model container [2024-11-12 04:52:21,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:52:21" (1/1) ... [2024-11-12 04:52:21,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:52:22,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-11-12 04:52:22,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:52:22,084 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:52:22,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-11-12 04:52:22,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:52:22,142 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:52:22,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22 WrapperNode [2024-11-12 04:52:22,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:52:22,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:52:22,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:52:22,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:52:22,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,188 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-12 04:52:22,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:52:22,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:52:22,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:52:22,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:52:22,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,231 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]. [2024-11-12 04:52:22,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:52:22,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:52:22,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:52:22,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:52:22,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (1/1) ... [2024-11-12 04:52:22,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:52:22,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:52:22,298 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) [2024-11-12 04:52:22,301 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 [2024-11-12 04:52:22,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:52:22,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:52:22,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:52:22,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:52:22,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:52:22,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:52:22,461 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:52:22,469 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:52:22,773 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:52:22,774 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:52:22,792 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:52:22,794 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:52:22,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:22 BoogieIcfgContainer [2024-11-12 04:52:22,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:52:22,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:52:22,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:52:22,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:52:22,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:52:21" (1/3) ... [2024-11-12 04:52:22,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6515ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:52:22, skipping insertion in model container [2024-11-12 04:52:22,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:22" (2/3) ... [2024-11-12 04:52:22,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6515ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:52:22, skipping insertion in model container [2024-11-12 04:52:22,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:22" (3/3) ... [2024-11-12 04:52:22,805 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-77.i [2024-11-12 04:52:22,822 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:52:22,822 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:52:22,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:52:22,906 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;@4da66a23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:52:22,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:52:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 04:52:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 04:52:22,928 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:22,930 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:52:22,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:22,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1831307112, now seen corresponding path program 1 times [2024-11-12 04:52:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:52:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640909008] [2024-11-12 04:52:22,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:52:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:52:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:52:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:52:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:52:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:52:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:52:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:52:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:52:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:52:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:52:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:52:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:52:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:52:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:52:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:52:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:52:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:52:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:52:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:52:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:52:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-12 04:52:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:52:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:52:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 04:52:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:52:23,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640909008] [2024-11-12 04:52:23,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640909008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:52:23,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:52:23,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:52:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443252580] [2024-11-12 04:52:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:52:23,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:52:23,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:52:23,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:52:23,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:52:23,463 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 04:52:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:52:23,498 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2024-11-12 04:52:23,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:52:23,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 140 [2024-11-12 04:52:23,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:52:23,508 INFO L225 Difference]: With dead ends: 113 [2024-11-12 04:52:23,509 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 04:52:23,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:52:23,520 INFO L435 NwaCegarLoop]: 83 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, 83 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 [2024-11-12 04:52:23,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:52:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 04:52:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 04:52:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 04:52:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-11-12 04:52:23,564 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 140 [2024-11-12 04:52:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:52:23,564 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-11-12 04:52:23,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 04:52:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-11-12 04:52:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 04:52:23,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:23,570 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:52:23,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:52:23,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:23,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1490144084, now seen corresponding path program 1 times [2024-11-12 04:52:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:52:23,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760657091] [2024-11-12 04:52:23,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:52:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:52:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:52:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:52:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:52:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:52:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:52:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:52:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:52:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:52:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:52:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:52:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:52:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:52:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:52:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:52:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:52:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:52:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:52:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:52:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:52:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-12 04:52:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:52:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:52:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 04:52:29,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:52:29,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760657091] [2024-11-12 04:52:29,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760657091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:52:29,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:52:29,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 04:52:29,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069850728] [2024-11-12 04:52:29,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:52:29,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 04:52:29,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:52:29,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 04:52:29,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:52:29,865 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 04:52:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:52:30,648 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2024-11-12 04:52:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 04:52:30,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-12 04:52:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:52:30,654 INFO L225 Difference]: With dead ends: 111 [2024-11-12 04:52:30,654 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 04:52:30,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:52:30,656 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 70 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:52:30,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 465 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:52:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 04:52:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2024-11-12 04:52:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 52 states have internal predecessors, (63), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 04:52:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2024-11-12 04:52:30,690 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 140 [2024-11-12 04:52:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:52:30,691 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2024-11-12 04:52:30,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 04:52:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2024-11-12 04:52:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 04:52:30,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:30,696 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:52:30,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:52:30,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:30,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash -810085714, now seen corresponding path program 1 times [2024-11-12 04:52:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:52:30,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114755746] [2024-11-12 04:52:30,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:30,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:52:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:52:30,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107274630] [2024-11-12 04:52:30,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:30,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:52:30,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:52:30,777 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) [2024-11-12 04:52:30,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:52:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:52:30,875 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:52:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:52:30,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:52:30,989 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:52:30,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:52:31,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 04:52:31,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:52:31,197 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 04:52:31,292 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:52:31,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:52:31 BoogieIcfgContainer [2024-11-12 04:52:31,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:52:31,300 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:52:31,302 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:52:31,302 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:52:31,303 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:22" (3/4) ... [2024-11-12 04:52:31,306 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:52:31,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:52:31,308 INFO L158 Benchmark]: Toolchain (without parser) took 9521.27ms. Allocated memory was 172.0MB in the beginning and 377.5MB in the end (delta: 205.5MB). Free memory was 121.7MB in the beginning and 154.9MB in the end (delta: -33.2MB). Peak memory consumption was 171.5MB. Max. memory is 16.1GB. [2024-11-12 04:52:31,308 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 65.0MB in the beginning and 64.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:52:31,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.96ms. Allocated memory is still 172.0MB. Free memory was 121.7MB in the beginning and 106.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:52:31,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.38ms. Allocated memory is still 172.0MB. Free memory was 106.9MB in the beginning and 104.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:52:31,309 INFO L158 Benchmark]: Boogie Preprocessor took 70.54ms. Allocated memory is still 172.0MB. Free memory was 104.2MB in the beginning and 100.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:52:31,309 INFO L158 Benchmark]: RCFGBuilder took 531.04ms. Allocated memory is still 172.0MB. Free memory was 100.0MB in the beginning and 128.7MB in the end (delta: -28.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 04:52:31,310 INFO L158 Benchmark]: TraceAbstraction took 8502.55ms. Allocated memory was 172.0MB in the beginning and 377.5MB in the end (delta: 205.5MB). Free memory was 127.8MB in the beginning and 155.9MB in the end (delta: -28.1MB). Peak memory consumption was 180.5MB. Max. memory is 16.1GB. [2024-11-12 04:52:31,310 INFO L158 Benchmark]: Witness Printer took 7.07ms. Allocated memory is still 377.5MB. Free memory was 155.9MB in the beginning and 154.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:52:31,314 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.17ms. Allocated memory is still 100.7MB. Free memory was 65.0MB in the beginning and 64.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.96ms. Allocated memory is still 172.0MB. Free memory was 121.7MB in the beginning and 106.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.38ms. Allocated memory is still 172.0MB. Free memory was 106.9MB in the beginning and 104.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.54ms. Allocated memory is still 172.0MB. Free memory was 104.2MB in the beginning and 100.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 531.04ms. Allocated memory is still 172.0MB. Free memory was 100.0MB in the beginning and 128.7MB in the end (delta: -28.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8502.55ms. Allocated memory was 172.0MB in the beginning and 377.5MB in the end (delta: 205.5MB). Free memory was 127.8MB in the beginning and 155.9MB in the end (delta: -28.1MB). Peak memory consumption was 180.5MB. Max. memory is 16.1GB. * Witness Printer took 7.07ms. Allocated memory is still 377.5MB. Free memory was 155.9MB in the beginning and 154.9MB in the end (delta: 1.0MB). 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 to_int at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 50; [L23] unsigned short int var_1_4 = 60871; [L24] unsigned short int var_1_5 = 1; [L25] unsigned short int var_1_6 = 28896; [L26] unsigned short int var_1_7 = 5; [L27] signed long int var_1_8 = 63; [L28] signed long int var_1_9 = 49; [L29] signed long int var_1_10 = 31; [L30] signed long int var_1_11 = 255; [L31] signed long int var_1_12 = 0; [L32] signed short int var_1_13 = -8; [L33] signed long int var_1_15 = 1000000000; [L34] unsigned short int var_1_16 = 4; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; VAL [isInitial=0, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=60871, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_ushort() [L68] CALL assume_abort_if_not(var_1_4 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L68] RET assume_abort_if_not(var_1_4 >= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L69] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L69] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L70] var_1_5 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L72] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L72] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L73] var_1_6 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_6 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=5, var_1_8=63, var_1_9=49] [L74] RET assume_abort_if_not(var_1_6 >= 16383) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=5, var_1_8=63, var_1_9=49] [L75] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=5, var_1_8=63, var_1_9=49] [L75] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=5, var_1_8=63, var_1_9=49] [L76] var_1_7 = __VERIFIER_nondet_ushort() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_8=63, var_1_9=49] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_8=63, var_1_9=49] [L78] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=49] [L78] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=49] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L88] var_1_12 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L89] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L90] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L91] var_1_15 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L92] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L93] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L94] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L96] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L98] var_1_18 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L99] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L100] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=63, var_1_9=0] [L113] RET updateVariables() [L114] CALL step() [L40] COND FALSE !(var_1_7 > var_1_5) [L43] var_1_8 = (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - (var_1_12 - 3.4f)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_9=0] [L45] unsigned short int stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=-49153, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_9=0] [L46] COND FALSE !(stepLocal_0 <= var_1_5) [L51] var_1_13 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=128, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_9=0] [L53] COND FALSE !(var_1_6 > (var_1_13 * ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))))) [L60] var_1_16 = var_1_6 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=128, var_1_15=2, var_1_16=-49153, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_9=0] [L62] COND FALSE !(var_1_8 != var_1_8) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=128, var_1_15=2, var_1_16=-49153, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_9=0] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return ((((var_1_8 != var_1_8) ? (var_1_1 == ((unsigned short int) (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))))) : 1) && ((var_1_7 > var_1_5) ? (var_1_8 == ((signed long int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((signed long int) (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - (var_1_12 - 3.4f)))))) && ((var_1_6 <= var_1_5) ? ((((((var_1_8) > ((var_1_12 / var_1_15))) ? (var_1_8) : ((var_1_12 / var_1_15)))) > ((((var_1_10) < (var_1_8)) ? (var_1_10) : (var_1_8)))) ? (var_1_13 == ((signed short int) var_1_7)) : 1) : (var_1_13 == ((signed short int) var_1_7)))) && ((var_1_6 > (var_1_13 * ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))))) ? ((var_1_17 || var_1_18) ? (var_1_16 == ((unsigned short int) var_1_4)) : (var_1_16 == ((unsigned short int) var_1_7))) : (var_1_16 == ((unsigned short int) var_1_6))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=128, var_1_15=2, var_1_16=-49153, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=0, var_1_9=0] [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=128, var_1_15=2, var_1_16=-49153, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=128, var_1_15=2, var_1_16=-49153, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=-32768, var_1_5=65664, var_1_6=-49153, var_1_7=-65408, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 548 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 380 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 168 mSDtfsCounter, 126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 30 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2024/2024 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:52:31,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.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 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:52:33,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:52:33,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:52:33,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:52:33,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:52:33,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:52:33,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:52:33,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:52:33,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:52:33,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:52:33,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:52:33,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:52:33,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:52:33,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:52:33,787 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:52:33,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:52:33,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:52:33,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:52:33,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:52:33,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:52:33,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:52:33,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:52:33,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:52:33,791 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:52:33,791 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:52:33,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:52:33,792 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:52:33,792 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:52:33,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:52:33,793 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:52:33,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:52:33,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:52:33,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:52:33,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:52:33,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:52:33,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:52:33,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:52:33,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:52:33,802 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:52:33,802 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:52:33,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:52:33,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:52:33,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:52:33,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:52:33,806 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff [2024-11-12 04:52:34,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:52:34,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:52:34,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:52:34,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:52:34,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:52:34,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-11-12 04:52:35,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:52:36,077 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:52:36,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-11-12 04:52:36,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2334cb29b/861b0027776844bf84d2d81fea01333c/FLAG54b980849 [2024-11-12 04:52:36,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2334cb29b/861b0027776844bf84d2d81fea01333c [2024-11-12 04:52:36,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:52:36,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:52:36,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:52:36,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:52:36,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:52:36,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ef259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36, skipping insertion in model container [2024-11-12 04:52:36,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:52:36,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-11-12 04:52:36,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:52:36,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:52:36,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-11-12 04:52:36,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:52:36,839 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:52:36,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36 WrapperNode [2024-11-12 04:52:36,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:52:36,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:52:36,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:52:36,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:52:36,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,896 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-12 04:52:36,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:52:36,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:52:36,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:52:36,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:52:36,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,947 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]. [2024-11-12 04:52:36,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:52:36,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:52:36,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:52:36,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:52:36,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (1/1) ... [2024-11-12 04:52:36,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:52:37,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:52:37,016 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) [2024-11-12 04:52:37,023 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 [2024-11-12 04:52:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:52:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:52:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:52:37,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:52:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:52:37,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:52:37,168 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:52:37,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:52:43,759 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:52:43,759 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:52:43,771 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:52:43,773 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:52:43,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:43 BoogieIcfgContainer [2024-11-12 04:52:43,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:52:43,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:52:43,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:52:43,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:52:43,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:52:36" (1/3) ... [2024-11-12 04:52:43,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72702c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:52:43, skipping insertion in model container [2024-11-12 04:52:43,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:36" (2/3) ... [2024-11-12 04:52:43,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72702c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:52:43, skipping insertion in model container [2024-11-12 04:52:43,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:43" (3/3) ... [2024-11-12 04:52:43,782 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-77.i [2024-11-12 04:52:43,796 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:52:43,796 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:52:43,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:52:43,889 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;@6077a238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:52:43,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:52:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 04:52:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 04:52:43,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:43,906 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:52:43,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:43,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1831307112, now seen corresponding path program 1 times [2024-11-12 04:52:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:52:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285275390] [2024-11-12 04:52:43,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:43,925 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 [2024-11-12 04:52:43,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:52:43,927 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) [2024-11-12 04:52:43,937 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 [2024-11-12 04:52:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:44,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:52:44,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:52:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-12 04:52:44,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:52:44,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:52:44,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285275390] [2024-11-12 04:52:44,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285275390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:52:44,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:52:44,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:52:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976836948] [2024-11-12 04:52:44,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:52:44,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:52:44,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:52:44,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:52:44,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:52:44,360 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 04:52:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:52:44,399 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2024-11-12 04:52:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:52:44,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 140 [2024-11-12 04:52:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:52:44,411 INFO L225 Difference]: With dead ends: 113 [2024-11-12 04:52:44,411 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 04:52:44,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:52:44,420 INFO L435 NwaCegarLoop]: 83 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, 83 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 [2024-11-12 04:52:44,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:52:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 04:52:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 04:52:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 04:52:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-11-12 04:52:44,476 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 140 [2024-11-12 04:52:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:52:44,478 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-11-12 04:52:44,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 04:52:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-11-12 04:52:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 04:52:44,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:44,484 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:52:44,497 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 [2024-11-12 04:52:44,686 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 [2024-11-12 04:52:44,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:44,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:44,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1490144084, now seen corresponding path program 1 times [2024-11-12 04:52:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:52:44,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352908813] [2024-11-12 04:52:44,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:44,690 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 [2024-11-12 04:52:44,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:52:44,694 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) [2024-11-12 04:52:44,695 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 [2024-11-12 04:52:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:52:44,921 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:52:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:52:45,143 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-12 04:52:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [553118111] [2024-11-12 04:52:45,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:45,144 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 04:52:45,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 04:52:45,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 04:52:45,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 04:52:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:45,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 04:52:45,675 INFO L279 TraceCheckSpWp]: Computing forward predicates...