./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-63.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 434983dfe381258f9957b77ebf7a8814bd68f5f503e8a119e287e5a59a77f408 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:35:36,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:35:36,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:35:36,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:35:36,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:35:36,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:35:36,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:35:36,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:35:36,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:35:36,896 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:35:36,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:35:36,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:35:36,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:35:36,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:35:36,900 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:35:36,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:35:36,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:36,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:35:36,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:35:36,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:35:36,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:35:36,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:35:36,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:35:36,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:35:36,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:35:36,902 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 434983dfe381258f9957b77ebf7a8814bd68f5f503e8a119e287e5a59a77f408 [2025-03-08 15:35:37,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:35:37,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:35:37,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:35:37,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:35:37,119 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:35:37,121 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-63.i [2025-03-08 15:35:38,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7742991/8f110561534049169b37bddce08dd135/FLAGc127e50d7 [2025-03-08 15:35:38,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:35:38,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-63.i [2025-03-08 15:35:38,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7742991/8f110561534049169b37bddce08dd135/FLAGc127e50d7 [2025-03-08 15:35:38,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7742991/8f110561534049169b37bddce08dd135 [2025-03-08 15:35:38,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:35:38,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:35:38,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:38,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:35:38,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:35:38,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:38" (1/1) ... [2025-03-08 15:35:38,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ad6b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:38, skipping insertion in model container [2025-03-08 15:35:38,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:38" (1/1) ... [2025-03-08 15:35:38,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:35:38,969 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-63.i[915,928] [2025-03-08 15:35:39,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:39,020 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:35:39,030 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-63.i[915,928] [2025-03-08 15:35:39,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:39,062 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:35:39,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39 WrapperNode [2025-03-08 15:35:39,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:39,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:39,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:35:39,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:35:39,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,103 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-08 15:35:39,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:39,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:35:39,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:35:39,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:35:39,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,120 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:35:39,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:35:39,128 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:35:39,128 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:35:39,128 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:35:39,128 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (1/1) ... [2025-03-08 15:35:39,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:39,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:35:39,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:35:39,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:35:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:35:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:35:39,174 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:35:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:35:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:35:39,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:35:39,217 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:35:39,218 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:35:39,377 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:35:39,378 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:35:39,384 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:35:39,384 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:35:39,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:39 BoogieIcfgContainer [2025-03-08 15:35:39,384 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:35:39,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:35:39,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:35:39,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:35:39,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:35:38" (1/3) ... [2025-03-08 15:35:39,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb183ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:39, skipping insertion in model container [2025-03-08 15:35:39,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:39" (2/3) ... [2025-03-08 15:35:39,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb183ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:39, skipping insertion in model container [2025-03-08 15:35:39,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:39" (3/3) ... [2025-03-08 15:35:39,392 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-63.i [2025-03-08 15:35:39,402 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:35:39,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-63.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:35:39,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:35:39,449 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;@1d2d1bfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:35:39,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:35:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 15:35:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 15:35:39,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:39,459 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:39,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:39,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash 869233060, now seen corresponding path program 1 times [2025-03-08 15:35:39,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:35:39,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134626171] [2025-03-08 15:35:39,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:39,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:35:39,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 15:35:39,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 15:35:39,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:39,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 15:35:39,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:35:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134626171] [2025-03-08 15:35:39,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134626171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:35:39,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031998816] [2025-03-08 15:35:39,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:39,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:35:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:35:39,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:35:39,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:35:39,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 15:35:39,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 15:35:39,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:39,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:39,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:35:39,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:35:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 15:35:39,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:35:39,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031998816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:35:39,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:35:39,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:35:39,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731274292] [2025-03-08 15:35:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:35:39,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:35:39,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:35:39,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:35:39,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:39,863 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 15:35:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:35:39,882 INFO L93 Difference]: Finished difference Result 102 states and 175 transitions. [2025-03-08 15:35:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:35:39,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2025-03-08 15:35:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:35:39,889 INFO L225 Difference]: With dead ends: 102 [2025-03-08 15:35:39,889 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 15:35:39,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:39,894 INFO L435 NwaCegarLoop]: 75 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, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:35:39,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:35:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 15:35:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 15:35:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 15:35:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2025-03-08 15:35:39,922 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 123 [2025-03-08 15:35:39,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:35:39,922 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2025-03-08 15:35:39,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 15:35:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2025-03-08 15:35:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 15:35:39,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:39,932 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:39,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:35:40,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:35:40,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:40,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:40,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1269192002, now seen corresponding path program 1 times [2025-03-08 15:35:40,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:35:40,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544283225] [2025-03-08 15:35:40,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:40,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:35:40,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 15:35:40,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 15:35:40,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:40,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:35:40,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:35:40,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 15:35:40,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 15:35:40,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:40,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:35:40,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:35:40,315 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:35:40,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:35:40,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:35:40,320 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 15:35:40,382 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:35:40,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:35:40 BoogieIcfgContainer [2025-03-08 15:35:40,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:35:40,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:35:40,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:35:40,386 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:35:40,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:39" (3/4) ... [2025-03-08 15:35:40,388 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:35:40,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:35:40,388 INFO L158 Benchmark]: Toolchain (without parser) took 1524.98ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 114.2MB in the end (delta: 7.4MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2025-03-08 15:35:40,389 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:35:40,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.10ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 109.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:35:40,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.84ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:35:40,389 INFO L158 Benchmark]: Boogie Preprocessor took 22.78ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 104.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:35:40,389 INFO L158 Benchmark]: IcfgBuilder took 256.79ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 89.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:35:40,389 INFO L158 Benchmark]: TraceAbstraction took 999.08ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 115.2MB in the end (delta: -26.6MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2025-03-08 15:35:40,390 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 114.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:35:40,390 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.25ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.10ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 109.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.84ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.78ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 104.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 256.79ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 89.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 999.08ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 115.2MB in the end (delta: -26.6MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 114.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 40, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 66. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 8.3; [L24] float var_1_3 = 2.25; [L25] float var_1_4 = 10.3; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] signed long int var_1_7 = 128; [L29] float var_1_8 = 9.8; [L30] signed long int var_1_9 = -256; [L31] unsigned short int var_1_10 = 5; [L32] signed char var_1_11 = 8; [L33] signed long int var_1_12 = 2; [L34] unsigned short int var_1_13 = 32; [L35] unsigned short int var_1_14 = 1; [L36] unsigned short int last_1_var_1_10 = 5; VAL [isInitial=0, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [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=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L62] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L64] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L65] var_1_4 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L66] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L67] var_1_5 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L68] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L69] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L69] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L70] var_1_6 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L71] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L72] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L72] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L73] var_1_8 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-256] [L74] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-256] [L75] var_1_9 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_9 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L76] RET assume_abort_if_not(var_1_9 >= -2147483647) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L77] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L78] var_1_11 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_11 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L79] RET assume_abort_if_not(var_1_11 >= -128) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L80] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L80] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L81] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L81] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L82] var_1_12 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L83] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L85] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L85] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L86] var_1_13 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L88] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L88] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L89] var_1_14 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L91] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=0, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=0, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L91] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=0, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=2147483646] [L105] RET updateVariables() [L106] CALL step() [L40] COND TRUE var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8) [L41] var_1_7 = ((((-200) > (last_1_var_1_10)) ? (-200) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=0, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=2147483646] [L45] COND FALSE !(var_1_8 > var_1_4) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=0, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=2147483646] [L56] COND TRUE ((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4) [L57] var_1_1 = (var_1_5 && var_1_6) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=0, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=2147483646] [L106] RET step() [L107] CALL, EXPR property() [L97-L98] return (((((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : 1) && ((var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8)) ? (var_1_7 == ((signed long int) ((((-200) > (last_1_var_1_10)) ? (-200) : (last_1_var_1_10))))) : (var_1_7 == ((signed long int) last_1_var_1_10)))) && ((var_1_8 > var_1_4) ? ((! var_1_6) ? (((var_1_9 / ((((var_1_11) > (-64)) ? (var_1_11) : (-64)))) < (var_1_7 / var_1_12)) ? (var_1_10 == ((unsigned short int) var_1_13)) : (var_1_10 == ((unsigned short int) var_1_13))) : (var_1_10 == ((unsigned short int) var_1_14))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=0, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=2147483646] [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=0, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=2147483646] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=0, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=2147483646] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 100 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 75 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, 75 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1482/1520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 15:35:40,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-63.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 434983dfe381258f9957b77ebf7a8814bd68f5f503e8a119e287e5a59a77f408 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:35:42,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:35:42,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:35:42,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:35:42,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:35:42,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:35:42,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:35:42,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:35:42,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:35:42,292 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:35:42,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:35:42,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:35:42,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:35:42,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:35:42,293 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:35:42,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:35:42,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:35:42,293 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:35:42,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:35:42,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:35:42,297 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:35:42,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:42,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:35:42,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:35:42,298 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:35:42,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:35:42,298 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:35:42,298 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:35:42,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:35:42,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:35:42,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:35:42,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:35:42,298 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 434983dfe381258f9957b77ebf7a8814bd68f5f503e8a119e287e5a59a77f408 [2025-03-08 15:35:42,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:35:42,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:35:42,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:35:42,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:35:42,532 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:35:42,533 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-63.i [2025-03-08 15:35:43,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0d8f599/7fc8584dcafa4074b26f3c22200e1f63/FLAGaf481eb1b [2025-03-08 15:35:43,891 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:35:43,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-63.i [2025-03-08 15:35:43,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0d8f599/7fc8584dcafa4074b26f3c22200e1f63/FLAGaf481eb1b [2025-03-08 15:35:44,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0d8f599/7fc8584dcafa4074b26f3c22200e1f63 [2025-03-08 15:35:44,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:35:44,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:35:44,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:44,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:35:44,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:35:44,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@951b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44, skipping insertion in model container [2025-03-08 15:35:44,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:35:44,351 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-63.i[915,928] [2025-03-08 15:35:44,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:44,408 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:35:44,417 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-63.i[915,928] [2025-03-08 15:35:44,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:44,454 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:35:44,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44 WrapperNode [2025-03-08 15:35:44,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:44,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:44,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:35:44,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:35:44,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,490 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-08 15:35:44,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:44,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:35:44,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:35:44,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:35:44,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,514 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:35:44,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:35:44,523 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:35:44,523 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:35:44,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:35:44,524 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (1/1) ... [2025-03-08 15:35:44,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:44,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:35:44,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:35:44,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:35:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:35:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:35:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:35:44,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:35:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:35:44,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:35:44,634 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:35:44,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:35:45,904 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:35:45,904 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:35:45,911 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:35:45,913 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:35:45,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:45 BoogieIcfgContainer [2025-03-08 15:35:45,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:35:45,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:35:45,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:35:45,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:35:45,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:35:44" (1/3) ... [2025-03-08 15:35:45,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c614538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:45, skipping insertion in model container [2025-03-08 15:35:45,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:44" (2/3) ... [2025-03-08 15:35:45,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c614538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:45, skipping insertion in model container [2025-03-08 15:35:45,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:45" (3/3) ... [2025-03-08 15:35:45,923 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-63.i [2025-03-08 15:35:45,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:35:45,934 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-63.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:35:45,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:35:45,981 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;@9a915d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:35:45,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:35:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 15:35:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 15:35:45,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:45,993 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:45,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:45,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash 869233060, now seen corresponding path program 1 times [2025-03-08 15:35:46,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:35:46,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939560107] [2025-03-08 15:35:46,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:46,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:46,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:35:46,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:35:46,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 15:35:46,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 15:35:46,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 15:35:46,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:46,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:46,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:35:46,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:35:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 15:35:46,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:35:46,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:35:46,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939560107] [2025-03-08 15:35:46,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939560107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:35:46,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:35:46,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:35:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457836458] [2025-03-08 15:35:46,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:35:46,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:35:46,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:35:46,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:35:46,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:46,311 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 15:35:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:35:46,329 INFO L93 Difference]: Finished difference Result 102 states and 175 transitions. [2025-03-08 15:35:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:35:46,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2025-03-08 15:35:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:35:46,334 INFO L225 Difference]: With dead ends: 102 [2025-03-08 15:35:46,334 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 15:35:46,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:46,338 INFO L435 NwaCegarLoop]: 75 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, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:35:46,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:35:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 15:35:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 15:35:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 15:35:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2025-03-08 15:35:46,365 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 123 [2025-03-08 15:35:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:35:46,365 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2025-03-08 15:35:46,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 15:35:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2025-03-08 15:35:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 15:35:46,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:46,369 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:46,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 15:35:46,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:46,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:46,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:46,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1269192002, now seen corresponding path program 1 times [2025-03-08 15:35:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:35:46,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297797754] [2025-03-08 15:35:46,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:46,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:46,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:35:46,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:35:46,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 15:35:46,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 15:35:46,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 15:35:46,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:46,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:46,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 15:35:46,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:36:14,151 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 15:36:40,323 WARN L286 SmtUtils]: Spent 9.79s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)