./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.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 a6d265bdbc1a49c23f97435873a48e7440ae9d92d59f2c53ecf9705b5276f1aa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:08:23,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:08:23,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:08:23,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:08:23,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:08:23,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:08:23,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:08:23,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:08:23,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:08:23,241 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:08:23,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:08:23,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:08:23,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:08:23,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:08:23,245 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:08:23,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:08:23,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:08:23,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:08:23,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:08:23,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:08:23,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:08:23,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:08:23,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:08:23,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:08:23,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:08:23,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:08:23,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:08:23,251 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:08:23,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:08:23,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:08:23,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:08:23,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:08:23,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:08:23,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:08:23,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:08:23,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:08:23,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:08:23,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:08:23,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:08:23,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:08:23,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:08:23,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:08:23,256 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 -> a6d265bdbc1a49c23f97435873a48e7440ae9d92d59f2c53ecf9705b5276f1aa [2024-11-10 09:08:23,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:08:23,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:08:23,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:08:23,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:08:23,547 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:08:23,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.i [2024-11-10 09:08:25,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:08:25,289 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:08:25,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.i [2024-11-10 09:08:25,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca896959/fbb41d88ed8a4bbaba3cd34daa16093d/FLAG6cd1f58ed [2024-11-10 09:08:25,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca896959/fbb41d88ed8a4bbaba3cd34daa16093d [2024-11-10 09:08:25,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:08:25,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:08:25,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:08:25,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:08:25,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:08:25,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:08:25" (1/1) ... [2024-11-10 09:08:25,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c44e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:25, skipping insertion in model container [2024-11-10 09:08:25,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:08:25" (1/1) ... [2024-11-10 09:08:25,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:08:25,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.i[913,926] [2024-11-10 09:08:25,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:08:25,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:08:25,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.i[913,926] [2024-11-10 09:08:25,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:08:26,001 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:08:26,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26 WrapperNode [2024-11-10 09:08:26,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:08:26,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:08:26,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:08:26,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:08:26,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,047 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-10 09:08:26,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:08:26,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:08:26,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:08:26,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:08:26,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,082 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 09:08:26,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:08:26,095 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:08:26,095 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:08:26,096 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:08:26,096 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (1/1) ... [2024-11-10 09:08:26,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:08:26,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:08:26,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:08:26,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:08:26,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:08:26,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:08:26,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:08:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:08:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:08:26,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:08:26,270 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:08:26,271 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:08:26,516 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 09:08:26,517 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:08:26,529 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:08:26,529 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:08:26,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:08:26 BoogieIcfgContainer [2024-11-10 09:08:26,530 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:08:26,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:08:26,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:08:26,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:08:26,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:08:25" (1/3) ... [2024-11-10 09:08:26,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705e264a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:08:26, skipping insertion in model container [2024-11-10 09:08:26,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:26" (2/3) ... [2024-11-10 09:08:26,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705e264a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:08:26, skipping insertion in model container [2024-11-10 09:08:26,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:08:26" (3/3) ... [2024-11-10 09:08:26,542 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-74.i [2024-11-10 09:08:26,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:08:26,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:08:26,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:08:26,619 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;@7043f85d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:08:26,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:08:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:08:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:08:26,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:08:26,639 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:08:26,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:08:26,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:08:26,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1965408431, now seen corresponding path program 1 times [2024-11-10 09:08:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:08:26,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759857014] [2024-11-10 09:08:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:08:26,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:08:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:26,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:08:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:26,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:08:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:08:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:26,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:08:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:08:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 09:08:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 09:08:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 09:08:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 09:08:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:08:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:08:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 09:08:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 09:08:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 09:08:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 09:08:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 09:08:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:08:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:08:27,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:08:27,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759857014] [2024-11-10 09:08:27,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759857014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:08:27,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:08:27,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:08:27,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956121043] [2024-11-10 09:08:27,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:08:27,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:08:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:08:27,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:08:27,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:08:27,136 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:08:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:08:27,168 INFO L93 Difference]: Finished difference Result 106 states and 174 transitions. [2024-11-10 09:08:27,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:08:27,171 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2024-11-10 09:08:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:08:27,180 INFO L225 Difference]: With dead ends: 106 [2024-11-10 09:08:27,180 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 09:08:27,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:08:27,187 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:08:27,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:08:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 09:08:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 09:08:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:08:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-10 09:08:27,227 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 111 [2024-11-10 09:08:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:08:27,228 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-10 09:08:27,229 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:08:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-10 09:08:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:08:27,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:08:27,234 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:08:27,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:08:27,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:08:27,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:08:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash -256561676, now seen corresponding path program 1 times [2024-11-10 09:08:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:08:27,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183643600] [2024-11-10 09:08:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:08:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:08:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:08:27,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:08:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:08:27,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:08:27,676 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:08:27,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:08:27,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:08:27,682 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 09:08:27,794 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:08:27,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:08:27 BoogieIcfgContainer [2024-11-10 09:08:27,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:08:27,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:08:27,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:08:27,802 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:08:27,803 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:08:26" (3/4) ... [2024-11-10 09:08:27,806 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:08:27,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:08:27,808 INFO L158 Benchmark]: Toolchain (without parser) took 2176.80ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 105.5MB in the beginning and 113.0MB in the end (delta: -7.5MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-11-10 09:08:27,808 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:08:27,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.35ms. Allocated memory is still 161.5MB. Free memory was 105.1MB in the beginning and 90.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 09:08:27,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.71ms. Allocated memory is still 161.5MB. Free memory was 90.8MB in the beginning and 88.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:08:27,811 INFO L158 Benchmark]: Boogie Preprocessor took 38.83ms. Allocated memory is still 161.5MB. Free memory was 88.6MB in the beginning and 85.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:08:27,811 INFO L158 Benchmark]: IcfgBuilder took 434.95ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 85.8MB in the beginning and 186.0MB in the end (delta: -100.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-10 09:08:27,811 INFO L158 Benchmark]: TraceAbstraction took 1268.71ms. Allocated memory is still 216.0MB. Free memory was 185.4MB in the beginning and 113.0MB in the end (delta: 72.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-11-10 09:08:27,812 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 216.0MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:08:27,813 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.20ms. Allocated memory is still 161.5MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.35ms. Allocated memory is still 161.5MB. Free memory was 105.1MB in the beginning and 90.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.71ms. Allocated memory is still 161.5MB. Free memory was 90.8MB in the beginning and 88.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.83ms. Allocated memory is still 161.5MB. Free memory was 88.6MB in the beginning and 85.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 434.95ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 85.8MB in the beginning and 186.0MB in the end (delta: -100.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1268.71ms. Allocated memory is still 216.0MB. Free memory was 185.4MB in the beginning and 113.0MB in the end (delta: 72.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 216.0MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 25; [L23] double var_1_2 = 63.25; [L24] double var_1_3 = 3.779; [L25] double var_1_4 = 31.6; [L26] double var_1_5 = 100.5; [L27] unsigned long int var_1_6 = 64; [L28] unsigned long int var_1_7 = 3150951169; [L29] unsigned long int var_1_8 = 128; [L30] unsigned long int var_1_9 = 1; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 9.3; [L33] unsigned char var_1_14 = 0; [L34] unsigned char var_1_15 = 1; [L35] unsigned char var_1_16 = 1; [L36] unsigned char last_1_var_1_16 = 1; VAL [isInitial=0, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_2=253/4, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_2=253/4, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L72] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L73] var_1_3 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L74] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L75] var_1_4 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L76] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L77] var_1_5 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L78] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L79] var_1_6 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=3150951169, var_1_8=128, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=3150951169, var_1_8=128, var_1_9=1] [L82] var_1_7 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=128, var_1_9=1] [L83] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=128, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=128, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=128, var_1_9=1] [L85] var_1_8 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_9=1] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_9=1] [L87] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=1] [L88] var_1_9 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297] [L89] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297] [L90] CALL assume_abort_if_not(var_1_9 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L90] RET assume_abort_if_not(var_1_9 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L91] var_1_11 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L92] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L93] var_1_14 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L94] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L95] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=-256, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=-256, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L95] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=-256, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L96] var_1_15 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=-256, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=-256, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L97] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=-256, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L98] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=-256, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=-256, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L98] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=-256, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L112] RET updateVariables() [L113] CALL step() [L40] unsigned char stepLocal_0 = last_1_var_1_16 && last_1_var_1_16; VAL [isInitial=1, last_1_var_1_16=1, stepLocal_0=1, var_1_10=1, var_1_14=-256, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L41] COND TRUE (var_1_5 > var_1_11) || stepLocal_0 [L42] var_1_10 = var_1_14 VAL [isInitial=1, last_1_var_1_16=1, var_1_10=-256, var_1_14=-256, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L46] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_16=1, stepLocal_1=-256, var_1_10=-256, var_1_14=-256, var_1_15=-255, var_1_16=1, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L47] COND FALSE !(stepLocal_1 && var_1_10) [L54] var_1_16 = var_1_15 VAL [isInitial=1, last_1_var_1_16=1, var_1_10=-256, var_1_14=-256, var_1_15=-255, var_1_16=-255, var_1_1=25, var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L56] COND TRUE ((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5 [L57] var_1_1 = ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=-256, var_1_14=-256, var_1_15=-255, var_1_16=-255, var_1_1=-(((__int128) 1 << 64) | 3), var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5) ? (var_1_1 == ((unsigned long int) ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))))) : ((var_1_2 >= (var_1_3 + var_1_5)) ? ((var_1_4 > (- var_1_5)) ? (var_1_1 == ((unsigned long int) var_1_6)) : (var_1_1 == ((unsigned long int) var_1_9))) : (var_1_1 == ((unsigned long int) var_1_6)))) && (((var_1_5 > var_1_11) || (last_1_var_1_16 && last_1_var_1_16)) ? (var_1_10 == ((unsigned char) var_1_14)) : (var_1_10 == ((unsigned char) (var_1_14 && (! var_1_15)))))) && ((var_1_10 && var_1_10) ? ((var_1_4 < (- var_1_5)) ? (var_1_16 == ((unsigned char) var_1_15)) : (var_1_16 == ((unsigned char) var_1_15))) : (var_1_16 == ((unsigned char) var_1_15))) ; VAL [\result=0, isInitial=1, last_1_var_1_16=1, var_1_10=-256, var_1_14=-256, var_1_15=-255, var_1_16=-255, var_1_1=-(((__int128) 1 << 64) | 3), var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=-256, var_1_14=-256, var_1_15=-255, var_1_16=-255, var_1_1=-(((__int128) 1 << 64) | 3), var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=1, var_1_10=-256, var_1_14=-256, var_1_15=-255, var_1_16=-255, var_1_1=-(((__int128) 1 << 64) | 3), var_1_6=-((__int128) 1 << 64), var_1_7=-(((__int128) 0 << 64) | 18446744069414584322U), var_1_8=4294967297, var_1_9=4294967294] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 74 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:08:27,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.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 a6d265bdbc1a49c23f97435873a48e7440ae9d92d59f2c53ecf9705b5276f1aa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:08:30,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:08:30,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:08:30,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:08:30,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:08:30,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:08:30,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:08:30,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:08:30,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:08:30,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:08:30,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:08:30,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:08:30,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:08:30,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:08:30,161 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:08:30,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:08:30,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:08:30,162 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:08:30,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:08:30,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:08:30,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:08:30,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:08:30,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:08:30,164 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:08:30,165 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:08:30,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:08:30,165 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:08:30,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:08:30,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:08:30,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:08:30,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:08:30,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:08:30,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:08:30,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:08:30,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:08:30,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:08:30,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:08:30,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:08:30,170 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:08:30,170 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:08:30,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:08:30,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:08:30,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:08:30,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:08:30,171 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 -> a6d265bdbc1a49c23f97435873a48e7440ae9d92d59f2c53ecf9705b5276f1aa [2024-11-10 09:08:30,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:08:30,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:08:30,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:08:30,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:08:30,536 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:08:30,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.i [2024-11-10 09:08:32,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:08:32,402 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:08:32,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.i [2024-11-10 09:08:32,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98eb6ceee/6309ae094ad64096bed24a31bce37213/FLAG3c5aafae3 [2024-11-10 09:08:32,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98eb6ceee/6309ae094ad64096bed24a31bce37213 [2024-11-10 09:08:32,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:08:32,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:08:32,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:08:32,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:08:32,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:08:32,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:08:32" (1/1) ... [2024-11-10 09:08:32,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cad7f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:32, skipping insertion in model container [2024-11-10 09:08:32,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:08:32" (1/1) ... [2024-11-10 09:08:32,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:08:32,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.i[913,926] [2024-11-10 09:08:33,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:08:33,057 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:08:33,071 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-74.i[913,926] [2024-11-10 09:08:33,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:08:33,129 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:08:33,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33 WrapperNode [2024-11-10 09:08:33,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:08:33,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:08:33,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:08:33,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:08:33,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,185 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-10 09:08:33,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:08:33,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:08:33,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:08:33,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:08:33,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,220 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 09:08:33,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:08:33,253 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:08:33,257 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:08:33,257 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:08:33,258 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (1/1) ... [2024-11-10 09:08:33,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:08:33,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:08:33,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:08:33,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:08:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:08:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:08:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:08:33,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:08:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:08:33,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:08:33,412 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:08:33,414 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:08:34,085 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 09:08:34,086 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:08:34,109 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:08:34,110 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:08:34,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:08:34 BoogieIcfgContainer [2024-11-10 09:08:34,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:08:34,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:08:34,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:08:34,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:08:34,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:08:32" (1/3) ... [2024-11-10 09:08:34,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500d8ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:08:34, skipping insertion in model container [2024-11-10 09:08:34,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:08:33" (2/3) ... [2024-11-10 09:08:34,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500d8ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:08:34, skipping insertion in model container [2024-11-10 09:08:34,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:08:34" (3/3) ... [2024-11-10 09:08:34,122 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-74.i [2024-11-10 09:08:34,141 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:08:34,141 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:08:34,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:08:34,226 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;@36f2697e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:08:34,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:08:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:08:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:08:34,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:08:34,246 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:08:34,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:08:34,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:08:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1965408431, now seen corresponding path program 1 times [2024-11-10 09:08:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:08:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029581918] [2024-11-10 09:08:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:08:34,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:08:34,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:08:34,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:08:34,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:08:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:34,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:08:34,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:08:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-10 09:08:34,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:08:34,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:08:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029581918] [2024-11-10 09:08:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029581918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:08:34,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:08:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:08:34,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104714423] [2024-11-10 09:08:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:08:34,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:08:34,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:08:34,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:08:34,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:08:34,591 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:08:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:08:34,619 INFO L93 Difference]: Finished difference Result 106 states and 174 transitions. [2024-11-10 09:08:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:08:34,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2024-11-10 09:08:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:08:34,628 INFO L225 Difference]: With dead ends: 106 [2024-11-10 09:08:34,628 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 09:08:34,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:08:34,638 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:08:34,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:08:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 09:08:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 09:08:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:08:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-10 09:08:34,679 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 111 [2024-11-10 09:08:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:08:34,679 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-10 09:08:34,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:08:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-10 09:08:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:08:34,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:08:34,682 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:08:34,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 09:08:34,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:08:34,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:08:34,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:08:34,885 INFO L85 PathProgramCache]: Analyzing trace with hash -256561676, now seen corresponding path program 1 times [2024-11-10 09:08:34,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:08:34,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85720493] [2024-11-10 09:08:34,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:08:34,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:08:34,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:08:34,889 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:08:34,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:08:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:08:35,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 09:08:35,128 INFO L278 TraceCheckSpWp]: Computing forward predicates...