./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_operatoramount_amount25_file-93.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 5fdcd3512df6d69f703fae7a0feb23c8c8183f92df695aec3643d46209d63489 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:55:24,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:55:24,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:55:24,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:55:24,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:55:24,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:55:24,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:55:24,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:55:24,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:55:24,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:55:24,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:55:24,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:55:24,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:55:24,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:55:24,248 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:55:24,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:55:24,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:55:24,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:55:24,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:55:24,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:55:24,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:55:24,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:55:24,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:55:24,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:55:24,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:55:24,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:55:24,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:55:24,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:55:24,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:55:24,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:55:24,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:55:24,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:55:24,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:55:24,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:55:24,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:55:24,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:55:24,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:55:24,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:55:24,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:55:24,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:55:24,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:55:24,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:55:24,257 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 -> 5fdcd3512df6d69f703fae7a0feb23c8c8183f92df695aec3643d46209d63489 [2024-11-09 00:55:24,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:55:24,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:55:24,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:55:24,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:55:24,548 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:55:24,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-93.i [2024-11-09 00:55:26,078 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:55:26,276 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:55:26,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-93.i [2024-11-09 00:55:26,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a533e37a/bd44b9ab10374d23b45a4cb9201739d7/FLAGdc0a12293 [2024-11-09 00:55:26,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a533e37a/bd44b9ab10374d23b45a4cb9201739d7 [2024-11-09 00:55:26,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:55:26,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:55:26,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:55:26,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:55:26,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:55:26,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:55:26" (1/1) ... [2024-11-09 00:55:26,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48093155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:26, skipping insertion in model container [2024-11-09 00:55:26,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:55:26" (1/1) ... [2024-11-09 00:55:26,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:55:26,897 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_operatoramount_amount25_file-93.i[915,928] [2024-11-09 00:55:26,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:55:26,970 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:55:26,987 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_operatoramount_amount25_file-93.i[915,928] [2024-11-09 00:55:27,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:55:27,040 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:55:27,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27 WrapperNode [2024-11-09 00:55:27,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:55:27,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:55:27,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:55:27,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:55:27,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,084 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-09 00:55:27,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:55:27,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:55:27,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:55:27,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:55:27,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,116 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-09 00:55:27,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:55:27,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:55:27,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:55:27,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:55:27,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (1/1) ... [2024-11-09 00:55:27,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:55:27,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:55:27,182 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-09 00:55:27,185 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-09 00:55:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:55:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:55:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:55:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:55:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:55:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:55:27,296 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:55:27,299 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:55:27,555 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:55:27,555 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:55:27,569 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:55:27,569 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:55:27,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:55:27 BoogieIcfgContainer [2024-11-09 00:55:27,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:55:27,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:55:27,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:55:27,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:55:27,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:55:26" (1/3) ... [2024-11-09 00:55:27,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1453d453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:55:27, skipping insertion in model container [2024-11-09 00:55:27,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:27" (2/3) ... [2024-11-09 00:55:27,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1453d453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:55:27, skipping insertion in model container [2024-11-09 00:55:27,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:55:27" (3/3) ... [2024-11-09 00:55:27,579 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-93.i [2024-11-09 00:55:27,596 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:55:27,596 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:55:27,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:55:27,665 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;@5587ce44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:55:27,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:55:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:55:27,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 00:55:27,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:27,686 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:55:27,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:27,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1212608925, now seen corresponding path program 1 times [2024-11-09 00:55:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:55:27,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702115900] [2024-11-09 00:55:27,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:27,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:55:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:27,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:55:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:27,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:55:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:27,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:55:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:27,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:55:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:55:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:55:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:55:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:55:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:55:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:55:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:55:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:55:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:55:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:55:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:55:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:55:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:55:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:55:28,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:55:28,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702115900] [2024-11-09 00:55:28,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702115900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:28,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:28,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:55:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958047124] [2024-11-09 00:55:28,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:28,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:55:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:55:28,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:55:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:55:28,163 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 00:55:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:28,198 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-09 00:55:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:55:28,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-09 00:55:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:28,211 INFO L225 Difference]: With dead ends: 101 [2024-11-09 00:55:28,211 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 00:55:28,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-09 00:55:28,222 INFO L432 NwaCegarLoop]: 73 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, 73 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-09 00:55:28,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:55:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 00:55:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 00:55:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:55:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-09 00:55:28,277 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2024-11-09 00:55:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:28,278 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-09 00:55:28,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 00:55:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-09 00:55:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 00:55:28,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:28,285 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:55:28,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:55:28,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:28,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:28,287 INFO L85 PathProgramCache]: Analyzing trace with hash 953632093, now seen corresponding path program 1 times [2024-11-09 00:55:28,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:55:28,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546288938] [2024-11-09 00:55:28,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:28,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:55:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:55:28,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:55:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:55:28,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:55:28,622 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:55:28,623 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:55:28,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:55:28,628 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 00:55:28,718 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:55:28,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:55:28 BoogieIcfgContainer [2024-11-09 00:55:28,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:55:28,723 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:55:28,723 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:55:28,723 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:55:28,724 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:55:27" (3/4) ... [2024-11-09 00:55:28,726 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:55:28,727 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:55:28,728 INFO L158 Benchmark]: Toolchain (without parser) took 2072.43ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 90.3MB in the beginning and 88.4MB in the end (delta: 1.9MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2024-11-09 00:55:28,729 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory was 106.0MB in the beginning and 105.9MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:55:28,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.20ms. Allocated memory is still 146.8MB. Free memory was 90.0MB in the beginning and 75.9MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:55:28,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.13ms. Allocated memory is still 146.8MB. Free memory was 75.5MB in the beginning and 73.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:55:28,730 INFO L158 Benchmark]: Boogie Preprocessor took 48.07ms. Allocated memory is still 146.8MB. Free memory was 73.5MB in the beginning and 71.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:55:28,731 INFO L158 Benchmark]: RCFGBuilder took 431.76ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 71.1MB in the beginning and 153.4MB in the end (delta: -82.3MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-11-09 00:55:28,731 INFO L158 Benchmark]: TraceAbstraction took 1150.84ms. Allocated memory is still 184.5MB. Free memory was 152.4MB in the beginning and 88.4MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-09 00:55:28,732 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 184.5MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:55:28,734 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.21ms. Allocated memory is still 146.8MB. Free memory was 106.0MB in the beginning and 105.9MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.20ms. Allocated memory is still 146.8MB. Free memory was 90.0MB in the beginning and 75.9MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.13ms. Allocated memory is still 146.8MB. Free memory was 75.5MB in the beginning and 73.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.07ms. Allocated memory is still 146.8MB. Free memory was 73.5MB in the beginning and 71.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.76ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 71.1MB in the beginning and 153.4MB in the end (delta: -82.3MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1150.84ms. Allocated memory is still 184.5MB. Free memory was 152.4MB in the beginning and 88.4MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 184.5MB. Free memory is still 88.4MB. 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 someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.3; [L23] double var_1_3 = -0.9; [L24] double var_1_4 = 2.6; [L25] double var_1_5 = 128.5; [L26] float var_1_7 = 1.25; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 1; [L29] unsigned char var_1_10 = 0; [L30] signed char var_1_11 = -1; [L31] signed char var_1_12 = -10; [L32] signed char var_1_13 = -32; [L33] signed char var_1_14 = -2; [L34] unsigned long int var_1_15 = 500; [L35] unsigned long int var_1_16 = 16; [L36] float last_1_var_1_1 = 255.3; [L37] unsigned char last_1_var_1_8 = 0; VAL [isInitial=0, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_1 = var_1_1 [L98] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L68] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L69] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L69] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L70] var_1_4 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L71] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L72] var_1_5 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L73] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L74] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L75] var_1_7 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L76] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L82] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L84] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L89] var_1_14 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_ulong() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L109] RET updateVariables() [L110] CALL step() [L41] COND FALSE !(((- last_1_var_1_1) / var_1_3) != (var_1_4 / var_1_5)) [L48] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=0, var_1_9=1] [L50] COND FALSE !(var_1_1 != var_1_1) [L55] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L57] COND FALSE !(var_1_1 < var_1_1) [L62] var_1_11 = (var_1_13 + var_1_14) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=126, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L64] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=126, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return ((((((- last_1_var_1_1) / var_1_3) != (var_1_4 / var_1_5)) ? (last_1_var_1_8 ? (var_1_1 == ((float) var_1_7)) : (var_1_1 == ((float) var_1_7))) : (var_1_1 == ((float) var_1_7))) && ((var_1_1 != var_1_1) ? ((var_1_1 < (var_1_1 * 15.25)) ? (var_1_8 == ((unsigned char) (! var_1_9))) : 1) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_1 < var_1_1) ? (var_1_10 ? (var_1_11 == ((signed char) var_1_12)) : 1) : (var_1_11 == ((signed char) (var_1_13 + var_1_14))))) && (var_1_15 == ((unsigned long int) var_1_16)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=126, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=126, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=126, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 73 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 612/612 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-09 00:55:28,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_operatoramount_amount25_file-93.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 5fdcd3512df6d69f703fae7a0feb23c8c8183f92df695aec3643d46209d63489 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:55:31,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:55:31,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:55:31,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:55:31,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:55:31,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:55:31,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:55:31,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:55:31,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:55:31,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:55:31,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:55:31,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:55:31,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:55:31,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:55:31,185 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:55:31,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:55:31,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:55:31,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:55:31,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:55:31,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:55:31,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:55:31,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:55:31,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:55:31,192 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:55:31,192 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:55:31,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:55:31,192 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:55:31,193 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:55:31,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:55:31,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:55:31,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:55:31,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:55:31,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:55:31,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:55:31,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:55:31,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:55:31,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:55:31,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:55:31,205 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:55:31,205 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:55:31,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:55:31,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:55:31,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:55:31,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:55:31,206 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 -> 5fdcd3512df6d69f703fae7a0feb23c8c8183f92df695aec3643d46209d63489 [2024-11-09 00:55:31,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:55:31,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:55:31,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:55:31,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:55:31,521 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:55:31,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-93.i [2024-11-09 00:55:33,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:55:33,328 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:55:33,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-93.i [2024-11-09 00:55:33,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816cd50fe/f8672fcf26a14fce8db231e88cdb7a16/FLAG80ffb0d32 [2024-11-09 00:55:33,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816cd50fe/f8672fcf26a14fce8db231e88cdb7a16 [2024-11-09 00:55:33,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:55:33,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:55:33,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:55:33,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:55:33,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:55:33,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:55:33" (1/1) ... [2024-11-09 00:55:33,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636910e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:33, skipping insertion in model container [2024-11-09 00:55:33,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:55:33" (1/1) ... [2024-11-09 00:55:33,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:55:33,939 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_operatoramount_amount25_file-93.i[915,928] [2024-11-09 00:55:34,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:55:34,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:55:34,042 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_operatoramount_amount25_file-93.i[915,928] [2024-11-09 00:55:34,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:55:34,097 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:55:34,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34 WrapperNode [2024-11-09 00:55:34,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:55:34,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:55:34,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:55:34,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:55:34,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,158 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-09 00:55:34,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:55:34,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:55:34,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:55:34,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:55:34,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,198 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-09 00:55:34,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:55:34,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:55:34,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:55:34,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:55:34,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (1/1) ... [2024-11-09 00:55:34,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:55:34,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:55:34,270 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-09 00:55:34,273 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-09 00:55:34,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:55:34,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:55:34,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:55:34,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:55:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:55:34,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:55:34,423 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:55:34,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:55:45,638 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:55:45,639 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:55:45,652 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:55:45,655 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:55:45,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:55:45 BoogieIcfgContainer [2024-11-09 00:55:45,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:55:45,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:55:45,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:55:45,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:55:45,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:55:33" (1/3) ... [2024-11-09 00:55:45,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ea8983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:55:45, skipping insertion in model container [2024-11-09 00:55:45,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:55:34" (2/3) ... [2024-11-09 00:55:45,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ea8983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:55:45, skipping insertion in model container [2024-11-09 00:55:45,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:55:45" (3/3) ... [2024-11-09 00:55:45,669 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-93.i [2024-11-09 00:55:45,687 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:55:45,687 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:55:45,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:55:45,764 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;@cc5ccbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:55:45,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:55:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:55:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 00:55:45,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:45,786 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:55:45,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:45,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:45,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1212608925, now seen corresponding path program 1 times [2024-11-09 00:55:45,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:55:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633003159] [2024-11-09 00:55:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:45,810 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-09 00:55:45,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:55:45,814 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-09 00:55:45,815 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-09 00:55:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:47,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:55:47,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:55:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-09 00:55:47,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:55:47,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:55:47,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633003159] [2024-11-09 00:55:47,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633003159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:55:47,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:55:47,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:55:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438472297] [2024-11-09 00:55:47,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:55:47,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:55:47,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:55:47,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:55:47,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:55:47,382 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 00:55:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:55:47,403 INFO L93 Difference]: Finished difference Result 100 states and 170 transitions. [2024-11-09 00:55:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:55:47,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-09 00:55:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:55:47,413 INFO L225 Difference]: With dead ends: 100 [2024-11-09 00:55:47,414 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 00:55:47,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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-09 00:55:47,421 INFO L432 NwaCegarLoop]: 70 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, 70 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-09 00:55:47,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:55:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 00:55:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-09 00:55:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:55:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-09 00:55:47,458 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 113 [2024-11-09 00:55:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:55:47,459 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-09 00:55:47,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 00:55:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-09 00:55:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 00:55:47,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:55:47,463 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:55:47,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:55:47,664 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-09 00:55:47,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:55:47,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:55:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash 953632093, now seen corresponding path program 1 times [2024-11-09 00:55:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:55:47,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111959347] [2024-11-09 00:55:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:55:47,666 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-09 00:55:47,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:55:47,668 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-09 00:55:47,669 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-09 00:55:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:55:49,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:55:49,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:56:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-09 00:56:27,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:56:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:56:46,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:56:46,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111959347] [2024-11-09 00:56:46,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111959347] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 00:56:46,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:56:46,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-09 00:56:46,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101355738] [2024-11-09 00:56:46,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:56:46,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:56:46,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:56:46,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:56:46,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:56:46,073 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:56:50,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []