./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.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 bc33678a96b4cfd3f62b1c8cf60c6fd0186557133d9529f189083aa906b84f07 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:34:04,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:34:04,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:34:04,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:34:04,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:34:04,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:34:04,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:34:04,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:34:04,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:34:04,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:34:04,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:34:04,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:34:04,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:34:04,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:34:04,767 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:34:04,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:34:04,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:34:04,768 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:34:04,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:34:04,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:34:04,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:34:04,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:34:04,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:34:04,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:34:04,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:34:04,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:34:04,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:34:04,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:34:04,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:34:04,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:34:04,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:34:04,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:34:04,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:34:04,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:34:04,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:34:04,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:34:04,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:34:04,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:34:04,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:34:04,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:34:04,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:34:04,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:34:04,780 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc33678a96b4cfd3f62b1c8cf60c6fd0186557133d9529f189083aa906b84f07 [2024-10-24 10:34:05,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:34:05,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:34:05,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:34:05,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:34:05,050 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:34:05,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.i [2024-10-24 10:34:06,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:34:06,713 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:34:06,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.i [2024-10-24 10:34:06,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9966e3c/59500a2117e442668abb6640b29f579f/FLAG3eacaed02 [2024-10-24 10:34:06,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9966e3c/59500a2117e442668abb6640b29f579f [2024-10-24 10:34:06,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:34:06,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:34:06,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:34:06,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:34:06,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:34:06,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:06" (1/1) ... [2024-10-24 10:34:06,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2cdd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:06, skipping insertion in model container [2024-10-24 10:34:06,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:06" (1/1) ... [2024-10-24 10:34:06,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:34:06,946 WARN L248 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-35.i[915,928] [2024-10-24 10:34:07,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:34:07,073 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:34:07,120 WARN L248 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-35.i[915,928] [2024-10-24 10:34:07,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:34:07,179 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:34:07,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07 WrapperNode [2024-10-24 10:34:07,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:34:07,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:34:07,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:34:07,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:34:07,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,227 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-24 10:34:07,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:34:07,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:34:07,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:34:07,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:34:07,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,255 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:34:07,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:34:07,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:34:07,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:34:07,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:34:07,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (1/1) ... [2024-10-24 10:34:07,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:34:07,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:34:07,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:34:07,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:34:07,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:34:07,365 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:34:07,366 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:34:07,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:34:07,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:34:07,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:34:07,447 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:34:07,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:34:07,702 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 10:34:07,702 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:34:07,763 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:34:07,763 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:34:07,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:07 BoogieIcfgContainer [2024-10-24 10:34:07,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:34:07,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:34:07,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:34:07,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:34:07,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:34:06" (1/3) ... [2024-10-24 10:34:07,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64024786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:07, skipping insertion in model container [2024-10-24 10:34:07,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:07" (2/3) ... [2024-10-24 10:34:07,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64024786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:07, skipping insertion in model container [2024-10-24 10:34:07,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:07" (3/3) ... [2024-10-24 10:34:07,775 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-35.i [2024-10-24 10:34:07,791 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:34:07,791 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:34:07,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:34:07,845 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;@5a68116a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:34:07,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:34:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 10:34:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 10:34:07,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:07,858 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:07,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:07,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1483062732, now seen corresponding path program 1 times [2024-10-24 10:34:07,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:07,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697504272] [2024-10-24 10:34:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:07,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:34:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:34:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:34:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:34:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:34:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 10:34:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 10:34:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:34:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:34:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 10:34:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 10:34:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:34:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 10:34:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 10:34:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 10:34:08,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697504272] [2024-10-24 10:34:08,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697504272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:08,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:08,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:34:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312986781] [2024-10-24 10:34:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:08,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:34:08,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:08,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:34:08,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:34:08,237 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 10:34:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:08,287 INFO L93 Difference]: Finished difference Result 97 states and 166 transitions. [2024-10-24 10:34:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:34:08,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2024-10-24 10:34:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:08,300 INFO L225 Difference]: With dead ends: 97 [2024-10-24 10:34:08,301 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 10:34:08,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:34:08,309 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:08,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:34:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 10:34:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 10:34:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 10:34:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2024-10-24 10:34:08,355 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 112 [2024-10-24 10:34:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:08,356 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2024-10-24 10:34:08,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 10:34:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2024-10-24 10:34:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 10:34:08,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:08,359 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:08,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:34:08,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:08,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash 21064384, now seen corresponding path program 1 times [2024-10-24 10:34:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:08,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577198518] [2024-10-24 10:34:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:34:08,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:34:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:34:08,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:34:08,729 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:34:08,730 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:34:08,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:34:08,735 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 10:34:08,810 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:34:08,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:34:08 BoogieIcfgContainer [2024-10-24 10:34:08,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:34:08,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:34:08,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:34:08,815 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:34:08,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:07" (3/4) ... [2024-10-24 10:34:08,817 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:34:08,819 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:34:08,820 INFO L158 Benchmark]: Toolchain (without parser) took 2077.54ms. Allocated memory is still 174.1MB. Free memory was 106.9MB in the beginning and 118.6MB in the end (delta: -11.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:34:08,821 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 174.1MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:34:08,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.64ms. Allocated memory is still 174.1MB. Free memory was 106.7MB in the beginning and 144.2MB in the end (delta: -37.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:34:08,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.97ms. Allocated memory is still 174.1MB. Free memory was 144.2MB in the beginning and 142.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:34:08,823 INFO L158 Benchmark]: Boogie Preprocessor took 50.71ms. Allocated memory is still 174.1MB. Free memory was 142.1MB in the beginning and 139.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:34:08,826 INFO L158 Benchmark]: RCFGBuilder took 484.17ms. Allocated memory is still 174.1MB. Free memory was 139.4MB in the beginning and 121.2MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 10:34:08,827 INFO L158 Benchmark]: TraceAbstraction took 1047.53ms. Allocated memory is still 174.1MB. Free memory was 120.5MB in the beginning and 118.6MB in the end (delta: 1.9MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2024-10-24 10:34:08,827 INFO L158 Benchmark]: Witness Printer took 4.89ms. Allocated memory is still 174.1MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:34:08,831 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.47ms. Allocated memory is still 174.1MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.64ms. Allocated memory is still 174.1MB. Free memory was 106.7MB in the beginning and 144.2MB in the end (delta: -37.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.97ms. Allocated memory is still 174.1MB. Free memory was 144.2MB in the beginning and 142.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.71ms. Allocated memory is still 174.1MB. Free memory was 142.1MB in the beginning and 139.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 484.17ms. Allocated memory is still 174.1MB. Free memory was 139.4MB in the beginning and 121.2MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1047.53ms. Allocated memory is still 174.1MB. Free memory was 120.5MB in the beginning and 118.6MB in the end (delta: 1.9MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Witness Printer took 4.89ms. Allocated memory is still 174.1MB. Free memory is still 118.6MB. 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 101, overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryArithmeticFLOAToperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 4.8; [L23] unsigned long int var_1_2 = 2; [L24] unsigned long int var_1_3 = 5; [L25] float var_1_4 = 255.1; [L26] float var_1_5 = -0.6; [L27] signed short int var_1_6 = -10; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] signed char var_1_11 = -2; [L31] signed char var_1_12 = 10; [L32] signed char var_1_13 = 5; [L33] float var_1_14 = 499.375; [L34] float var_1_15 = 0.0; [L35] float var_1_16 = 63.2; [L36] float var_1_17 = 0.0; [L37] float var_1_18 = 15.75; [L38] float var_1_19 = 5.75; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L69] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L69] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L72] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L73] var_1_4 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L74] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L75] var_1_5 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L76] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L78] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L80] var_1_8 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L82] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L82] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L84] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L85] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L85] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L87] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L88] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L88] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L89] var_1_15 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L90] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L91] var_1_16 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L92] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L93] var_1_17 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L94] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L95] var_1_18 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L96] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L109] RET updateVariables() [L110] CALL step() [L42] unsigned long int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=4294967268, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_2=4294967268, var_1_6=-10, var_1_7=0, var_1_8=1] [L43] COND TRUE stepLocal_0 >= (~ var_1_3) [L44] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, var_1_11=-2, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_19=23/4, var_1_2=4294967268, var_1_3=27, var_1_6=-10, var_1_7=0, var_1_8=1] [L46] var_1_11 = (-32 + (var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13))))) [L47] signed char stepLocal_1 = var_1_12; VAL [isInitial=1, stepLocal_1=27, var_1_11=4, var_1_12=27, var_1_13=9, var_1_14=3995/8, var_1_19=23/4, var_1_2=4294967268, var_1_3=27, var_1_6=-10, var_1_7=0, var_1_8=1] [L48] COND FALSE !(stepLocal_1 != var_1_3) [L53] var_1_14 = var_1_18 VAL [isInitial=1, var_1_11=4, var_1_12=27, var_1_13=9, var_1_14=4294967273, var_1_18=4294967273, var_1_19=23/4, var_1_2=4294967268, var_1_3=27, var_1_6=-10, var_1_7=0, var_1_8=1] [L55] var_1_19 = var_1_5 VAL [isInitial=1, var_1_11=4, var_1_12=27, var_1_13=9, var_1_14=4294967273, var_1_18=4294967273, var_1_19=4294967274, var_1_2=4294967268, var_1_3=27, var_1_5=4294967274, var_1_6=-10, var_1_7=0, var_1_8=1] [L56] COND FALSE !(\read(var_1_7)) [L63] var_1_6 = var_1_11 VAL [isInitial=1, var_1_11=4, var_1_12=27, var_1_13=9, var_1_14=4294967273, var_1_18=4294967273, var_1_19=4294967274, var_1_2=4294967268, var_1_3=27, var_1_5=4294967274, var_1_6=4, var_1_7=0, var_1_8=1] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return (((((var_1_2 >= (~ var_1_3)) ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) && (var_1_7 ? (var_1_8 ? (var_1_6 == ((signed short int) (var_1_11 + var_1_11))) : (var_1_6 == ((signed short int) (var_1_11 + var_1_11)))) : (var_1_6 == ((signed short int) var_1_11)))) && (var_1_11 == ((signed char) (-32 + (var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13)))))))) && ((var_1_12 != var_1_3) ? (var_1_7 ? (var_1_14 == ((float) ((var_1_15 - var_1_16) - (var_1_17 - var_1_18)))) : 1) : (var_1_14 == ((float) var_1_18)))) && (var_1_19 == ((float) var_1_5)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=4, var_1_12=27, var_1_13=9, var_1_14=4294967273, var_1_18=4294967273, var_1_19=4294967274, var_1_2=4294967268, var_1_3=27, var_1_5=4294967274, var_1_6=4, var_1_7=0, var_1_8=1] [L19] reach_error() VAL [isInitial=1, var_1_11=4, var_1_12=27, var_1_13=9, var_1_14=4294967273, var_1_18=4294967273, var_1_19=4294967274, var_1_2=4294967268, var_1_3=27, var_1_5=4294967274, var_1_6=4, var_1_7=0, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 67 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 612/612 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:34:08,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.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 bc33678a96b4cfd3f62b1c8cf60c6fd0186557133d9529f189083aa906b84f07 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:34:11,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:34:11,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:34:11,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:34:11,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:34:11,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:34:11,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:34:11,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:34:11,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:34:11,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:34:11,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:34:11,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:34:11,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:34:11,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:34:11,153 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:34:11,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:34:11,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:34:11,158 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:34:11,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:34:11,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:34:11,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:34:11,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:34:11,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:34:11,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:34:11,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:34:11,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:34:11,162 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:34:11,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:34:11,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:34:11,163 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:34:11,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:34:11,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:34:11,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:34:11,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:34:11,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:34:11,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:34:11,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:34:11,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:34:11,166 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:34:11,166 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:34:11,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:34:11,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:34:11,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:34:11,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:34:11,167 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:34:11,168 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc33678a96b4cfd3f62b1c8cf60c6fd0186557133d9529f189083aa906b84f07 [2024-10-24 10:34:11,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:34:11,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:34:11,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:34:11,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:34:11,546 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:34:11,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.i [2024-10-24 10:34:13,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:34:13,397 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:34:13,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.i [2024-10-24 10:34:13,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fd0cbce/df15933bae34469f9dff4d3f9c1e54a4/FLAG589dcf9e2 [2024-10-24 10:34:13,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fd0cbce/df15933bae34469f9dff4d3f9c1e54a4 [2024-10-24 10:34:13,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:34:13,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:34:13,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:34:13,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:34:13,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:34:13,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d8b98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13, skipping insertion in model container [2024-10-24 10:34:13,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:34:13,644 WARN L248 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-35.i[915,928] [2024-10-24 10:34:13,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:34:13,713 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:34:13,728 WARN L248 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-35.i[915,928] [2024-10-24 10:34:13,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:34:13,779 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:34:13,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13 WrapperNode [2024-10-24 10:34:13,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:34:13,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:34:13,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:34:13,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:34:13,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,835 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-10-24 10:34:13,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:34:13,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:34:13,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:34:13,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:34:13,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,868 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:34:13,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:34:13,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:34:13,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:34:13,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:34:13,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (1/1) ... [2024-10-24 10:34:13,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:34:13,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:34:13,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:34:13,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:34:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:34:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:34:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:34:13,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:34:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:34:13,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:34:14,075 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:34:14,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:34:15,417 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 10:34:15,417 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:34:15,470 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:34:15,470 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:34:15,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:15 BoogieIcfgContainer [2024-10-24 10:34:15,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:34:15,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:34:15,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:34:15,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:34:15,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:34:13" (1/3) ... [2024-10-24 10:34:15,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@963b773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:15, skipping insertion in model container [2024-10-24 10:34:15,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:13" (2/3) ... [2024-10-24 10:34:15,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@963b773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:15, skipping insertion in model container [2024-10-24 10:34:15,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:15" (3/3) ... [2024-10-24 10:34:15,484 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-35.i [2024-10-24 10:34:15,500 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:34:15,500 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:34:15,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:34:15,568 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;@305281dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:34:15,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:34:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 10:34:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 10:34:15,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:15,583 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:15,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:15,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:15,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1483062732, now seen corresponding path program 1 times [2024-10-24 10:34:15,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:34:15,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113774290] [2024-10-24 10:34:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:15,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:34:15,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:34:15,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 10:34:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:15,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:34:15,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:34:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-10-24 10:34:15,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:34:15,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:34:15,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113774290] [2024-10-24 10:34:15,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113774290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:15,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:15,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:34:15,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317548101] [2024-10-24 10:34:15,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:15,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:34:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:34:16,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:34:16,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:34:16,014 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 10:34:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:16,885 INFO L93 Difference]: Finished difference Result 97 states and 166 transitions. [2024-10-24 10:34:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:34:16,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2024-10-24 10:34:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:16,904 INFO L225 Difference]: With dead ends: 97 [2024-10-24 10:34:16,905 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 10:34:16,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:34:16,910 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:16,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 10:34:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 10:34:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 10:34:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 10:34:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2024-10-24 10:34:16,946 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 112 [2024-10-24 10:34:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:16,947 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2024-10-24 10:34:16,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 10:34:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2024-10-24 10:34:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 10:34:16,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:16,950 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:16,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 10:34:17,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:17,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:17,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash 21064384, now seen corresponding path program 1 times [2024-10-24 10:34:17,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:34:17,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861770644] [2024-10-24 10:34:17,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:17,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:34:17,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:34:17,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 10:34:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:17,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 10:34:17,474 INFO L278 TraceCheckSpWp]: Computing forward predicates...