./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-19.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 06f837d7928db541d2d48c927f11a6eb52920c5b0369de6ffc2b007ce4b98eea --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:25:47,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:25:47,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:25:47,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:25:47,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:25:48,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:25:48,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:25:48,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:25:48,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:25:48,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:25:48,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:25:48,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:25:48,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:25:48,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:25:48,019 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:25:48,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:25:48,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:25:48,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:25:48,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:25:48,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:25:48,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:25:48,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:25:48,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:25:48,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:25:48,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:25:48,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:25:48,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:25:48,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:25:48,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:25:48,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:25:48,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:25:48,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:25:48,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:25:48,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:25:48,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:25:48,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:25:48,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:25:48,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:25:48,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:25:48,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:25:48,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:25:48,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:25:48,032 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 -> 06f837d7928db541d2d48c927f11a6eb52920c5b0369de6ffc2b007ce4b98eea [2024-11-12 06:25:48,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:25:48,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:25:48,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:25:48,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:25:48,414 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:25:48,417 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-19.i [2024-11-12 06:25:49,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:25:50,247 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:25:50,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-19.i [2024-11-12 06:25:50,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e9a977d/94abcd753f954e6083d76f775b2f7ea7/FLAGf642dafb4 [2024-11-12 06:25:50,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e9a977d/94abcd753f954e6083d76f775b2f7ea7 [2024-11-12 06:25:50,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:25:50,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:25:50,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:25:50,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:25:50,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:25:50,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:50,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2de34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50, skipping insertion in model container [2024-11-12 06:25:50,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:50,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:25:50,815 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-19.i[915,928] [2024-11-12 06:25:50,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:25:50,875 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:25:50,886 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-19.i[915,928] [2024-11-12 06:25:50,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:25:50,927 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:25:50,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50 WrapperNode [2024-11-12 06:25:50,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:25:50,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:25:50,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:25:50,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:25:50,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:50,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:50,989 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-12 06:25:50,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:25:50,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:25:50,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:25:50,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:25:51,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:51,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:51,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:51,025 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:25:51,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:51,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:51,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:51,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:51,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:51,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:51,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:25:51,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:25:51,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:25:51,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:25:51,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (1/1) ... [2024-11-12 06:25:51,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:25:51,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:25:51,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:25:51,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:25:51,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:25:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:25:51,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:25:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:25:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:25:51,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:25:51,326 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:25:51,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:25:51,647 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:25:51,647 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:25:51,666 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:25:51,667 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:25:51,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:51 BoogieIcfgContainer [2024-11-12 06:25:51,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:25:51,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:25:51,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:25:51,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:25:51,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:25:50" (1/3) ... [2024-11-12 06:25:51,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571dedc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:25:51, skipping insertion in model container [2024-11-12 06:25:51,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:50" (2/3) ... [2024-11-12 06:25:51,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571dedc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:25:51, skipping insertion in model container [2024-11-12 06:25:51,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:51" (3/3) ... [2024-11-12 06:25:51,680 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-19.i [2024-11-12 06:25:51,698 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:25:51,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:25:51,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:25:51,791 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;@58e4de89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:25:51,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:25:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 06:25:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 06:25:51,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:25:51,808 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:25:51,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:25:51,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:25:51,816 INFO L85 PathProgramCache]: Analyzing trace with hash -562109802, now seen corresponding path program 1 times [2024-11-12 06:25:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:25:51,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262607874] [2024-11-12 06:25:51,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:25:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:25:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:25:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:25:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:25:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:25:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:25:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:25:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:25:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:25:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:25:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:25:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:25:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:25:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:25:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:25:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:25:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:25:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 06:25:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 06:25:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:25:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262607874] [2024-11-12 06:25:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262607874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:25:52,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:25:52,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:25:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899527300] [2024-11-12 06:25:52,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:25:52,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:25:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:25:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:25:52,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:25:52,286 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 06:25:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:25:52,311 INFO L93 Difference]: Finished difference Result 111 states and 183 transitions. [2024-11-12 06:25:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:25:52,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2024-11-12 06:25:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:25:52,324 INFO L225 Difference]: With dead ends: 111 [2024-11-12 06:25:52,326 INFO L226 Difference]: Without dead ends: 55 [2024-11-12 06:25:52,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:25:52,333 INFO L435 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:25:52,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:25:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-12 06:25:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-12 06:25:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 06:25:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-11-12 06:25:52,393 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 113 [2024-11-12 06:25:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:25:52,394 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-11-12 06:25:52,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 06:25:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-11-12 06:25:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 06:25:52,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:25:52,401 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:25:52,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:25:52,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:25:52,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:25:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash 51368796, now seen corresponding path program 1 times [2024-11-12 06:25:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:25:52,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28682094] [2024-11-12 06:25:52,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:25:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:25:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:25:52,696 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:25:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:25:52,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:25:52,886 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:25:52,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:25:52,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:25:52,895 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 06:25:53,012 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:25:53,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:25:53 BoogieIcfgContainer [2024-11-12 06:25:53,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:25:53,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:25:53,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:25:53,022 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:25:53,023 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:51" (3/4) ... [2024-11-12 06:25:53,026 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:25:53,027 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:25:53,029 INFO L158 Benchmark]: Toolchain (without parser) took 2440.20ms. Allocated memory was 169.9MB in the beginning and 216.0MB in the end (delta: 46.1MB). Free memory was 135.9MB in the beginning and 154.3MB in the end (delta: -18.4MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-11-12 06:25:53,029 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 169.9MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:25:53,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.55ms. Allocated memory is still 169.9MB. Free memory was 135.9MB in the beginning and 121.7MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:25:53,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.59ms. Allocated memory is still 169.9MB. Free memory was 121.7MB in the beginning and 119.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:25:53,031 INFO L158 Benchmark]: Boogie Preprocessor took 53.56ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 116.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:25:53,034 INFO L158 Benchmark]: RCFGBuilder took 622.27ms. Allocated memory is still 169.9MB. Free memory was 116.5MB in the beginning and 124.2MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 06:25:53,034 INFO L158 Benchmark]: TraceAbstraction took 1349.53ms. Allocated memory was 169.9MB in the beginning and 216.0MB in the end (delta: 46.1MB). Free memory was 123.8MB in the beginning and 155.3MB in the end (delta: -31.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-12 06:25:53,034 INFO L158 Benchmark]: Witness Printer took 6.80ms. Allocated memory is still 216.0MB. Free memory was 155.3MB in the beginning and 154.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:25:53,041 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.41ms. Allocated memory is still 169.9MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.55ms. Allocated memory is still 169.9MB. Free memory was 135.9MB in the beginning and 121.7MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.59ms. Allocated memory is still 169.9MB. Free memory was 121.7MB in the beginning and 119.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.56ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 116.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 622.27ms. Allocated memory is still 169.9MB. Free memory was 116.5MB in the beginning and 124.2MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1349.53ms. Allocated memory was 169.9MB in the beginning and 216.0MB in the end (delta: 46.1MB). Free memory was 123.8MB in the beginning and 155.3MB in the end (delta: -31.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Witness Printer took 6.80ms. Allocated memory is still 216.0MB. Free memory was 155.3MB in the beginning and 154.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 8; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] unsigned long int var_1_4 = 1; [L26] unsigned long int var_1_5 = 5; [L27] signed char var_1_7 = 4; [L28] signed char var_1_8 = 100; [L29] unsigned char var_1_9 = 1; [L30] signed long int var_1_10 = -8; [L31] float var_1_11 = 255.2; [L32] float var_1_12 = 128.25; [L33] float var_1_13 = 100.5; [L34] float var_1_14 = 255.9; [L35] signed long int var_1_15 = -128; [L36] unsigned short int var_1_16 = 2; [L37] signed long int last_1_var_1_10 = -8; VAL [isInitial=0, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=128, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=128, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L66] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L67] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L68] var_1_3 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L70] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L71] var_1_4 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_4 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L73] RET assume_abort_if_not(var_1_4 <= 12) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_7=4, var_1_8=100, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_7=4, var_1_8=100, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 11) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=4, var_1_8=100, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 11) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=4, var_1_8=100, var_1_9=1] [L77] var_1_7 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L78] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L79] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L80] var_1_8 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L82] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L83] var_1_9 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0] [L84] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L86] var_1_12 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L88] var_1_13 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L90] var_1_14 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L105] RET updateVariables() [L106] CALL step() [L41] COND FALSE !(var_1_7 < var_1_3) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L46] COND TRUE \read(var_1_9) [L47] var_1_10 = var_1_5 VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L50] var_1_11 = (var_1_12 + (var_1_13 + var_1_14)) [L51] var_1_16 = 64 VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=-128, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L52] COND TRUE \read(var_1_9) [L53] var_1_15 = (var_1_7 + var_1_16) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L55] signed long int stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_10=-8, stepLocal_0=127, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L56] EXPR (var_1_2 - var_1_3) << (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_10=-8, stepLocal_0=127, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L56] COND TRUE ((var_1_2 - var_1_3) << (var_1_4 + var_1_5)) <= stepLocal_0 [L57] var_1_1 = ((((var_1_4) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_4) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (var_1_2 - var_1_3) << (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L97-L98] return (((((((var_1_2 - var_1_3) << (var_1_4 + var_1_5)) <= var_1_15) ? (var_1_1 == ((signed char) ((((var_1_4) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_4) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))))) : (var_1_9 ? (var_1_1 == ((signed char) var_1_5)) : 1)) && ((var_1_7 < var_1_3) ? ((last_1_var_1_10 > var_1_7) ? (var_1_10 == ((signed long int) (var_1_3 - var_1_8))) : 1) : (var_1_9 ? (var_1_10 == ((signed long int) var_1_5)) : 1))) && (var_1_11 == ((float) (var_1_12 + (var_1_13 + var_1_14))))) && (var_1_9 ? (var_1_15 == ((signed long int) (var_1_7 + var_1_16))) : 1)) && (var_1_16 == ((unsigned short int) 64)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 17, 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, 79 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, 79 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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.3s 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, 544/544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 06:25:53,083 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-19.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 06f837d7928db541d2d48c927f11a6eb52920c5b0369de6ffc2b007ce4b98eea --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:25:55,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:25:55,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:25:55,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:25:55,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:25:55,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:25:55,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:25:55,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:25:55,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:25:55,759 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:25:55,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:25:55,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:25:55,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:25:55,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:25:55,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:25:55,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:25:55,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:25:55,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:25:55,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:25:55,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:25:55,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:25:55,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:25:55,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:25:55,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:25:55,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:25:55,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:25:55,768 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:25:55,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:25:55,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:25:55,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:25:55,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:25:55,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:25:55,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:25:55,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:25:55,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:25:55,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:25:55,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:25:55,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:25:55,777 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:25:55,777 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:25:55,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:25:55,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:25:55,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:25:55,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:25:55,780 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 -> 06f837d7928db541d2d48c927f11a6eb52920c5b0369de6ffc2b007ce4b98eea [2024-11-12 06:25:56,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:25:56,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:25:56,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:25:56,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:25:56,158 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:25:56,160 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-19.i [2024-11-12 06:25:57,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:25:57,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:25:58,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-19.i [2024-11-12 06:25:58,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f7a347ba/9679c6de14ed4c4ebfb7dd35bb73e07c/FLAGdbeafae06 [2024-11-12 06:25:58,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f7a347ba/9679c6de14ed4c4ebfb7dd35bb73e07c [2024-11-12 06:25:58,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:25:58,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:25:58,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:25:58,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:25:58,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:25:58,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d246dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58, skipping insertion in model container [2024-11-12 06:25:58,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:25:58,610 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-19.i[915,928] [2024-11-12 06:25:58,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:25:58,680 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:25:58,694 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-19.i[915,928] [2024-11-12 06:25:58,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:25:58,757 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:25:58,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58 WrapperNode [2024-11-12 06:25:58,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:25:58,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:25:58,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:25:58,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:25:58,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,816 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-12 06:25:58,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:25:58,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:25:58,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:25:58,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:25:58,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,865 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:25:58,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:25:58,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:25:58,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:25:58,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:25:58,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (1/1) ... [2024-11-12 06:25:58,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:25:58,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:25:58,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:25:58,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:25:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:25:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:25:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:25:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:25:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:25:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:25:59,117 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:25:59,121 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:25:59,764 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:25:59,765 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:25:59,782 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:25:59,784 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:25:59,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:59 BoogieIcfgContainer [2024-11-12 06:25:59,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:25:59,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:25:59,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:25:59,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:25:59,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:25:58" (1/3) ... [2024-11-12 06:25:59,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f08229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:25:59, skipping insertion in model container [2024-11-12 06:25:59,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:58" (2/3) ... [2024-11-12 06:25:59,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f08229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:25:59, skipping insertion in model container [2024-11-12 06:25:59,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:59" (3/3) ... [2024-11-12 06:25:59,798 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-19.i [2024-11-12 06:25:59,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:25:59,820 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:25:59,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:25:59,946 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;@33408393, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:25:59,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:25:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 06:25:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 06:25:59,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:25:59,970 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:25:59,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:25:59,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:25:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1979840240, now seen corresponding path program 1 times [2024-11-12 06:26:00,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:26:00,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424404504] [2024-11-12 06:26:00,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:26:00,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:26:00,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:26:00,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:26:00,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 06:26:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:26:00,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:26:00,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:26:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-12 06:26:00,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:26:00,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:26:00,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424404504] [2024-11-12 06:26:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424404504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:26:00,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:26:00,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:26:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277443575] [2024-11-12 06:26:00,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:26:00,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:26:00,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:26:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:26:00,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:26:00,468 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 06:26:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:26:00,507 INFO L93 Difference]: Finished difference Result 101 states and 169 transitions. [2024-11-12 06:26:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:26:00,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2024-11-12 06:26:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:26:00,519 INFO L225 Difference]: With dead ends: 101 [2024-11-12 06:26:00,520 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 06:26:00,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:26:00,534 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:26:00,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:26:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 06:26:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 06:26:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 06:26:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-12 06:26:00,593 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 110 [2024-11-12 06:26:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:26:00,594 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-12 06:26:00,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 06:26:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-12 06:26:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 06:26:00,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:26:00,599 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:26:00,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 06:26:00,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:26:00,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:26:00,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:26:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash 453389290, now seen corresponding path program 1 times [2024-11-12 06:26:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:26:00,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077759377] [2024-11-12 06:26:00,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:26:00,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:26:00,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:26:00,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:26:00,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 06:26:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:26:01,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 06:26:01,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:26:27,659 WARN L286 SmtUtils]: Spent 7.86s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 06:26:46,182 WARN L286 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 06:27:05,813 WARN L286 SmtUtils]: Spent 7.57s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)