./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_variablewrapping_normal_file-20.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_variablewrapping_normal_file-20.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 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:03:06,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:03:06,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:03:06,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:03:06,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:03:06,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:03:06,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:03:06,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:03:06,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:03:06,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:03:06,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:03:06,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:03:06,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:03:06,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:03:06,497 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:03:06,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:03:06,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:03:06,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:03:06,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:03:06,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:03:06,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:03:06,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:03:06,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:03:06,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:03:06,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:03:06,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:03:06,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:03:06,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:03:06,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:03:06,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:03:06,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:03:06,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:03:06,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:03:06,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:03:06,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:03:06,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:03:06,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:03:06,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:03:06,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:03:06,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:03:06,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:03:06,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:03:06,505 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 -> 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 [2024-10-24 11:03:06,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:03:06,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:03:06,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:03:06,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:03:06,769 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:03:06,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.i [2024-10-24 11:03:08,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:03:08,253 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:03:08,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.i [2024-10-24 11:03:08,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3764e315c/65547f2ab354401293b53f1b736e5a18/FLAGd5742e458 [2024-10-24 11:03:08,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3764e315c/65547f2ab354401293b53f1b736e5a18 [2024-10-24 11:03:08,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:03:08,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:03:08,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:03:08,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:03:08,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:03:08,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5c2a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08, skipping insertion in model container [2024-10-24 11:03:08,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:03:08,503 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_variablewrapping_normal_file-20.i[913,926] [2024-10-24 11:03:08,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:03:08,569 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:03:08,580 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_variablewrapping_normal_file-20.i[913,926] [2024-10-24 11:03:08,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:03:08,621 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:03:08,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08 WrapperNode [2024-10-24 11:03:08,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:03:08,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:03:08,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:03:08,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:03:08,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,668 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-24 11:03:08,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:03:08,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:03:08,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:03:08,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:03:08,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,700 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 11:03:08,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:03:08,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:03:08,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:03:08,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:03:08,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (1/1) ... [2024-10-24 11:03:08,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:03:08,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:03:08,749 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 11:03:08,751 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 11:03:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:03:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:03:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:03:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:03:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:03:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:03:08,845 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:03:08,847 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:03:09,023 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 11:03:09,023 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:03:09,080 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:03:09,080 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:03:09,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:03:09 BoogieIcfgContainer [2024-10-24 11:03:09,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:03:09,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:03:09,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:03:09,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:03:09,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:03:08" (1/3) ... [2024-10-24 11:03:09,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1c5677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:03:09, skipping insertion in model container [2024-10-24 11:03:09,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:08" (2/3) ... [2024-10-24 11:03:09,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1c5677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:03:09, skipping insertion in model container [2024-10-24 11:03:09,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:03:09" (3/3) ... [2024-10-24 11:03:09,087 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-20.i [2024-10-24 11:03:09,101 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:03:09,101 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:03:09,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:03:09,155 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;@79a7c52a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:03:09,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:03:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:03:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:03:09,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:09,169 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:09,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:09,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:09,175 INFO L85 PathProgramCache]: Analyzing trace with hash -229145093, now seen corresponding path program 1 times [2024-10-24 11:03:09,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:03:09,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047994293] [2024-10-24 11:03:09,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:09,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:03:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:03:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:03:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:03:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:03:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:03:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 11:03:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 11:03:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 11:03:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:03:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 11:03:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:03:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:03:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 11:03:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 11:03:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 11:03:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 11:03:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:03:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:03:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 11:03:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:03:09,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:03:09,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047994293] [2024-10-24 11:03:09,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047994293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:03:09,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:03:09,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:03:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515545614] [2024-10-24 11:03:09,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:03:09,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:03:09,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:03:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:03:09,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:03:09,530 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:03:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:03:09,562 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2024-10-24 11:03:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:03:09,591 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 117 [2024-10-24 11:03:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:03:09,599 INFO L225 Difference]: With dead ends: 99 [2024-10-24 11:03:09,600 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 11:03:09,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 11:03:09,608 INFO L432 NwaCegarLoop]: 69 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, 69 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 11:03:09,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:03:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 11:03:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 11:03:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:03:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2024-10-24 11:03:09,689 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 117 [2024-10-24 11:03:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:03:09,692 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2024-10-24 11:03:09,692 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:03:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2024-10-24 11:03:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:03:09,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:09,698 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:09,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:03:09,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:09,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash -430746639, now seen corresponding path program 1 times [2024-10-24 11:03:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:03:09,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555082186] [2024-10-24 11:03:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:03:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:03:09,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:03:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:03:09,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:03:09,977 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:03:09,978 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:03:09,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:03:09,982 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 11:03:10,054 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:03:10,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:03:10 BoogieIcfgContainer [2024-10-24 11:03:10,057 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:03:10,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:03:10,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:03:10,058 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:03:10,058 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:03:09" (3/4) ... [2024-10-24 11:03:10,060 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:03:10,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:03:10,063 INFO L158 Benchmark]: Toolchain (without parser) took 1779.20ms. Allocated memory was 140.5MB in the beginning and 180.4MB in the end (delta: 39.8MB). Free memory was 69.8MB in the beginning and 117.9MB in the end (delta: -48.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:03:10,063 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 140.5MB. Free memory was 93.8MB in the beginning and 93.6MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:03:10,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.14ms. Allocated memory was 140.5MB in the beginning and 180.4MB in the end (delta: 39.8MB). Free memory was 69.7MB in the beginning and 146.8MB in the end (delta: -77.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-10-24 11:03:10,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.83ms. Allocated memory is still 180.4MB. Free memory was 146.8MB in the beginning and 144.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:03:10,065 INFO L158 Benchmark]: Boogie Preprocessor took 40.80ms. Allocated memory is still 180.4MB. Free memory was 144.7MB in the beginning and 141.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:03:10,067 INFO L158 Benchmark]: RCFGBuilder took 366.18ms. Allocated memory is still 180.4MB. Free memory was 141.5MB in the beginning and 121.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 11:03:10,067 INFO L158 Benchmark]: TraceAbstraction took 975.24ms. Allocated memory is still 180.4MB. Free memory was 120.6MB in the beginning and 117.9MB in the end (delta: 2.7MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2024-10-24 11:03:10,067 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 180.4MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:03:10,069 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.15ms. Allocated memory is still 140.5MB. Free memory was 93.8MB in the beginning and 93.6MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.14ms. Allocated memory was 140.5MB in the beginning and 180.4MB in the end (delta: 39.8MB). Free memory was 69.7MB in the beginning and 146.8MB in the end (delta: -77.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.83ms. Allocated memory is still 180.4MB. Free memory was 146.8MB in the beginning and 144.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.80ms. Allocated memory is still 180.4MB. Free memory was 144.7MB in the beginning and 141.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.18ms. Allocated memory is still 180.4MB. Free memory was 141.5MB in the beginning and 121.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 975.24ms. Allocated memory is still 180.4MB. Free memory was 120.6MB in the beginning and 117.9MB in the end (delta: 2.7MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 180.4MB. Free memory is still 117.9MB. 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 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticFLOAToperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 4.6; [L30] unsigned long int var_1_9 = 256; [L31] unsigned char var_1_10 = 0; [L32] unsigned long int var_1_11 = 3724367395; [L33] unsigned long int var_1_12 = 25; [L34] unsigned long int var_1_13 = 1; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 100; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L71] var_1_3 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L72] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L73] var_1_4 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_4 >= 0.0F && 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_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L74] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L75] var_1_5 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L76] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L77] var_1_6 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L78] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L79] var_1_8 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L80] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L82] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L83] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L83] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L84] var_1_11 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_11 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L85] RET assume_abort_if_not(var_1_11 >= 3221225470) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L86] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L86] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L87] var_1_12 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L88] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L89] CALL assume_abort_if_not(var_1_12 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L89] RET assume_abort_if_not(var_1_12 <= 1073741823) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L90] var_1_13 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L91] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L92] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L92] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L93] var_1_15 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L94] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L95] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L95] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L96] var_1_16 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L97] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L98] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L98] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L111] RET updateVariables() [L112] CALL step() [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L46] var_1_7 = ((15.5 + var_1_4) - (var_1_3 - var_1_8)) [L47] unsigned long int stepLocal_2 = var_1_13; [L48] signed long int stepLocal_1 = 5; VAL [isInitial=1, stepLocal_1=5, stepLocal_2=0, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L49] COND FALSE !(stepLocal_1 >= var_1_11) VAL [isInitial=1, stepLocal_2=0, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L60] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-255, stepLocal_2=0, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L61] COND TRUE var_1_10 || stepLocal_0 [L62] var_1_9 = ((var_1_11 - var_1_14) - var_1_14) VAL [isInitial=1, stepLocal_2=0, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=3221225468] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_7 == ((double) ((15.5 + var_1_4) - (var_1_3 - var_1_8))))) && ((var_1_10 || var_1_2) ? (var_1_9 == ((unsigned long int) ((var_1_11 - var_1_14) - var_1_14))) : (var_1_9 == ((unsigned long int) (var_1_14 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))))) && ((5 >= var_1_11) ? ((var_1_1 >= var_1_8) ? (var_1_14 == ((unsigned char) (128 - 16))) : ((var_1_13 >= ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) ? (var_1_14 == ((unsigned char) (var_1_15 - var_1_16))) : (var_1_14 == ((unsigned char) var_1_16)))) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=3221225468] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1, var_1_13=0, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=3221225468] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 19, 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, 69 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, 69 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 684/684 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 11:03:10,103 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_variablewrapping_normal_file-20.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 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:03:12,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:03:12,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:03:12,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:03:12,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:03:12,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:03:12,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:03:12,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:03:12,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:03:12,131 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:03:12,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:03:12,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:03:12,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:03:12,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:03:12,134 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:03:12,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:03:12,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:03:12,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:03:12,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:03:12,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:03:12,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:03:12,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:03:12,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:03:12,140 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:03:12,140 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:03:12,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:03:12,141 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:03:12,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:03:12,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:03:12,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:03:12,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:03:12,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:03:12,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:03:12,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:03:12,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:03:12,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:03:12,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:03:12,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:03:12,145 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:03:12,145 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:03:12,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:03:12,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:03:12,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:03:12,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:03:12,147 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:03:12,147 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 -> 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 [2024-10-24 11:03:12,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:03:12,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:03:12,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:03:12,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:03:12,483 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:03:12,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.i [2024-10-24 11:03:13,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:03:13,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:03:13,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.i [2024-10-24 11:03:13,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6725064/f66f0f2aa0cf401fae53cf27cf0ee58b/FLAGa4ad5d011 [2024-10-24 11:03:13,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6725064/f66f0f2aa0cf401fae53cf27cf0ee58b [2024-10-24 11:03:13,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:03:13,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:03:13,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:03:13,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:03:14,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:03:14,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:03:13" (1/1) ... [2024-10-24 11:03:14,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3bc560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14, skipping insertion in model container [2024-10-24 11:03:14,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:03:13" (1/1) ... [2024-10-24 11:03:14,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:03:14,186 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_variablewrapping_normal_file-20.i[913,926] [2024-10-24 11:03:14,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:03:14,247 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:03:14,257 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_variablewrapping_normal_file-20.i[913,926] [2024-10-24 11:03:14,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:03:14,289 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:03:14,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14 WrapperNode [2024-10-24 11:03:14,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:03:14,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:03:14,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:03:14,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:03:14,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,338 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-24 11:03:14,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:03:14,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:03:14,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:03:14,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:03:14,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,370 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 11:03:14,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:03:14,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:03:14,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:03:14,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:03:14,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (1/1) ... [2024-10-24 11:03:14,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:03:14,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:03:14,428 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 11:03:14,431 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 11:03:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:03:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:03:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:03:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:03:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:03:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:03:14,534 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:03:14,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:03:20,625 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 11:03:20,625 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:03:20,670 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:03:20,670 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:03:20,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:03:20 BoogieIcfgContainer [2024-10-24 11:03:20,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:03:20,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:03:20,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:03:20,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:03:20,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:03:13" (1/3) ... [2024-10-24 11:03:20,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418b9181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:03:20, skipping insertion in model container [2024-10-24 11:03:20,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:14" (2/3) ... [2024-10-24 11:03:20,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418b9181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:03:20, skipping insertion in model container [2024-10-24 11:03:20,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:03:20" (3/3) ... [2024-10-24 11:03:20,677 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-20.i [2024-10-24 11:03:20,691 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:03:20,692 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:03:20,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:03:20,759 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;@60191587, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:03:20,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:03:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:03:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:03:20,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:20,773 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:20,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash -229145093, now seen corresponding path program 1 times [2024-10-24 11:03:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:03:20,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014293192] [2024-10-24 11:03:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:20,789 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 11:03:20,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:03:20,792 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 11:03:20,793 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 11:03:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:21,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:03:21,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:03:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-10-24 11:03:21,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:03:21,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:03:21,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014293192] [2024-10-24 11:03:21,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014293192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:03:21,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:03:21,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:03:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642018791] [2024-10-24 11:03:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:03:21,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:03:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:03:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:03:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:03:21,352 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:03:25,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:03:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:03:25,522 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2024-10-24 11:03:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:03:25,571 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 117 [2024-10-24 11:03:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:03:25,577 INFO L225 Difference]: With dead ends: 99 [2024-10-24 11:03:25,577 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 11:03:25,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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 11:03:25,583 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:03:25,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 11:03:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 11:03:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 11:03:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:03:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2024-10-24 11:03:25,626 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 117 [2024-10-24 11:03:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:03:25,627 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2024-10-24 11:03:25,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:03:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2024-10-24 11:03:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:03:25,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:25,630 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:03:25,646 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 11:03:25,831 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 11:03:25,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:25,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -430746639, now seen corresponding path program 1 times [2024-10-24 11:03:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:03:25,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362289595] [2024-10-24 11:03:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:25,833 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 11:03:25,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:03:25,835 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 11:03:25,837 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 11:03:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:26,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 11:03:26,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:04:03,391 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 11:04:11,525 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 11:04:19,660 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 11:04:27,800 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 11:04:35,936 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 11:04:43,658 WARN L286 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)