./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_codestructure_normal_file-26.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 1e02c5de11e993114d19017be871476fa0b70a2f3ad74a20775a8f209845e0a0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:32:56,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:32:56,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:32:56,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:32:56,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:32:56,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:32:56,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:32:56,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:32:56,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:32:56,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:32:56,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:32:56,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:32:56,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:32:56,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:32:56,250 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:32:56,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:32:56,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:32:56,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:32:56,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:32:56,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:32:56,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:32:56,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:32:56,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:32:56,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:32:56,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:32:56,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:32:56,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:32:56,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:32:56,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:32:56,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:32:56,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:32:56,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:32:56,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:32:56,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:32:56,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:32:56,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:32:56,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:32:56,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:32:56,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:32:56,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:32:56,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:32:56,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:32:56,263 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 -> 1e02c5de11e993114d19017be871476fa0b70a2f3ad74a20775a8f209845e0a0 [2024-11-08 19:32:56,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:32:56,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:32:56,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:32:56,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:32:56,559 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:32:56,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-26.i [2024-11-08 19:32:58,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:32:58,252 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:32:58,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-26.i [2024-11-08 19:32:58,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51f76a00/98e6d264bf7d4e3984d4e0ce55965215/FLAG3d1284fa7 [2024-11-08 19:32:58,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51f76a00/98e6d264bf7d4e3984d4e0ce55965215 [2024-11-08 19:32:58,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:32:58,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:32:58,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:32:58,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:32:58,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:32:58,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ad575d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58, skipping insertion in model container [2024-11-08 19:32:58,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:32:58,491 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_codestructure_normal_file-26.i[913,926] [2024-11-08 19:32:58,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:32:58,569 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:32:58,579 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_codestructure_normal_file-26.i[913,926] [2024-11-08 19:32:58,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:32:58,641 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:32:58,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58 WrapperNode [2024-11-08 19:32:58,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:32:58,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:32:58,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:32:58,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:32:58,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,719 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-08 19:32:58,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:32:58,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:32:58,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:32:58,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:32:58,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,785 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-08 19:32:58,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:32:58,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:32:58,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:32:58,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:32:58,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (1/1) ... [2024-11-08 19:32:58,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:32:58,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:32:58,864 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-08 19:32:58,868 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-08 19:32:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:32:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:32:58,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:32:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:32:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:32:58,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:32:58,978 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:32:58,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:32:59,367 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:32:59,367 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:32:59,386 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:32:59,387 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:32:59,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:32:59 BoogieIcfgContainer [2024-11-08 19:32:59,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:32:59,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:32:59,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:32:59,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:32:59,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:32:58" (1/3) ... [2024-11-08 19:32:59,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341a5119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:32:59, skipping insertion in model container [2024-11-08 19:32:59,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:58" (2/3) ... [2024-11-08 19:32:59,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341a5119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:32:59, skipping insertion in model container [2024-11-08 19:32:59,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:32:59" (3/3) ... [2024-11-08 19:32:59,400 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-26.i [2024-11-08 19:32:59,418 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:32:59,418 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:32:59,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:32:59,499 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;@10e76e6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:32:59,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:32:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 19:32:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:32:59,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:32:59,523 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:59,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:32:59,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:32:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1388779724, now seen corresponding path program 1 times [2024-11-08 19:32:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:32:59,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634870241] [2024-11-08 19:32:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:32:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:32:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:32:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:32:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:32:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:32:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:32:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:32:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:32:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:32:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:32:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:32:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:32:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:32:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:32:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 19:32:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:32:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 19:32:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:32:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 19:32:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:33:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:33:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 19:33:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 19:33:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:33:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 19:33:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:33:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:33:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:33:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 19:33:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:33:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:33:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:33:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 19:33:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 19:33:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 19:33:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 19:33:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:33:00,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:33:00,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634870241] [2024-11-08 19:33:00,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634870241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:33:00,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:33:00,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:33:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899880189] [2024-11-08 19:33:00,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:33:00,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:33:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:33:00,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:33:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:33:00,167 INFO L87 Difference]: Start difference. First operand has 85 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-08 19:33:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:33:00,203 INFO L93 Difference]: Finished difference Result 163 states and 296 transitions. [2024-11-08 19:33:00,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:33:00,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 215 [2024-11-08 19:33:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:33:00,213 INFO L225 Difference]: With dead ends: 163 [2024-11-08 19:33:00,214 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 19:33:00,218 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-08 19:33:00,223 INFO L432 NwaCegarLoop]: 126 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, 126 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-08 19:33:00,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:33:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 19:33:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 19:33:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 19:33:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2024-11-08 19:33:00,283 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 215 [2024-11-08 19:33:00,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:33:00,283 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2024-11-08 19:33:00,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-08 19:33:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2024-11-08 19:33:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:33:00,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:00,289 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:33:00,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:33:00,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:00,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:00,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1271238724, now seen corresponding path program 1 times [2024-11-08 19:33:00,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:33:00,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381603522] [2024-11-08 19:33:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:00,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:33:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:33:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:33:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:33:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:33:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:33:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:33:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:33:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:33:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:33:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:33:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:33:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:33:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:33:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 19:33:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:33:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 19:33:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:33:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 19:33:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:33:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:33:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 19:33:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 19:33:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:33:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 19:33:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:33:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:33:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:33:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 19:33:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:33:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:33:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:33:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 19:33:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 19:33:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 19:33:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 19:33:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:33:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:33:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381603522] [2024-11-08 19:33:00,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381603522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:33:00,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:33:00,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:33:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340927556] [2024-11-08 19:33:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:33:00,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:33:00,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:33:00,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:33:00,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:33:00,816 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 19:33:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:33:00,956 INFO L93 Difference]: Finished difference Result 200 states and 311 transitions. [2024-11-08 19:33:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:33:00,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 215 [2024-11-08 19:33:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:33:00,960 INFO L225 Difference]: With dead ends: 200 [2024-11-08 19:33:00,960 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 19:33:00,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:33:00,963 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 60 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:33:00,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 300 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:33:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 19:33:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2024-11-08 19:33:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 66 states have internal predecessors, (83), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 19:33:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 185 transitions. [2024-11-08 19:33:01,001 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 185 transitions. Word has length 215 [2024-11-08 19:33:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:33:01,005 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 185 transitions. [2024-11-08 19:33:01,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 19:33:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 185 transitions. [2024-11-08 19:33:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 19:33:01,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:01,013 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:33:01,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:33:01,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:01,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash -376993936, now seen corresponding path program 1 times [2024-11-08 19:33:01,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:33:01,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765705524] [2024-11-08 19:33:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:01,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:33:01,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277894949] [2024-11-08 19:33:01,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:01,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:33:01,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:33:01,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:33:01,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:33:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:33:01,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:33:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:33:01,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:33:01,723 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:33:01,725 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:33:01,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:33:01,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:33:01,932 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 19:33:02,090 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:33:02,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:33:02 BoogieIcfgContainer [2024-11-08 19:33:02,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:33:02,095 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:33:02,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:33:02,096 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:33:02,096 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:32:59" (3/4) ... [2024-11-08 19:33:02,100 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:33:02,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:33:02,104 INFO L158 Benchmark]: Toolchain (without parser) took 3826.24ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 100.9MB in the beginning and 87.6MB in the end (delta: 13.3MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-11-08 19:33:02,105 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 157.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:33:02,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.80ms. Allocated memory is still 157.3MB. Free memory was 100.7MB in the beginning and 84.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:33:02,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.67ms. Allocated memory is still 157.3MB. Free memory was 84.4MB in the beginning and 80.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:33:02,106 INFO L158 Benchmark]: Boogie Preprocessor took 106.66ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 80.9MB in the beginning and 184.6MB in the end (delta: -103.7MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-08 19:33:02,107 INFO L158 Benchmark]: RCFGBuilder took 560.90ms. Allocated memory is still 213.9MB. Free memory was 184.6MB in the beginning and 160.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 19:33:02,107 INFO L158 Benchmark]: TraceAbstraction took 2704.15ms. Allocated memory is still 213.9MB. Free memory was 160.5MB in the beginning and 88.5MB in the end (delta: 72.0MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2024-11-08 19:33:02,107 INFO L158 Benchmark]: Witness Printer took 6.36ms. Allocated memory is still 213.9MB. Free memory was 88.5MB in the beginning and 87.6MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:33:02,109 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.13ms. Allocated memory is still 157.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.80ms. Allocated memory is still 157.3MB. Free memory was 100.7MB in the beginning and 84.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.67ms. Allocated memory is still 157.3MB. Free memory was 84.4MB in the beginning and 80.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.66ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 80.9MB in the beginning and 184.6MB in the end (delta: -103.7MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * RCFGBuilder took 560.90ms. Allocated memory is still 213.9MB. Free memory was 184.6MB in the beginning and 160.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2704.15ms. Allocated memory is still 213.9MB. Free memory was 160.5MB in the beginning and 88.5MB in the end (delta: 72.0MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * Witness Printer took 6.36ms. Allocated memory is still 213.9MB. Free memory was 88.5MB in the beginning and 87.6MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 153. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_2 = 4; [L24] signed long int var_1_3 = 10; [L25] signed long int var_1_4 = -64; [L26] signed long int var_1_5 = -2; [L27] unsigned long int var_1_6 = 256; [L28] unsigned long int var_1_7 = 4; [L29] unsigned long int var_1_8 = 128; [L30] signed char var_1_9 = 10; [L31] unsigned char var_1_10 = 0; [L32] signed char var_1_11 = -1; [L33] unsigned short int var_1_12 = 10000; [L34] float var_1_13 = 5.4; [L35] float var_1_14 = 1.4; [L36] float var_1_15 = 128.9; [L37] float var_1_16 = 199.75; [L38] unsigned long int var_1_17 = 16; [L39] unsigned short int var_1_18 = 32; [L40] unsigned short int var_1_19 = 32; [L41] double var_1_20 = 1.5; [L42] double var_1_21 = 2.75; [L43] unsigned char var_1_22 = 5; [L44] unsigned short int var_1_23 = 55712; [L45] unsigned char var_1_24 = 5; [L46] signed short int var_1_25 = 10; [L47] float var_1_26 = 64.2; VAL [isInitial=0, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=4, var_1_3=10, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L157] isInitial = 1 [L158] FCALL initially() [L159] COND TRUE 1 [L160] FCALL updateLastVariables() [L161] CALL updateVariables() [L93] var_1_2 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=10, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=10, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L94] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=10, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L95] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=10, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=10, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L95] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=10, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L96] var_1_3 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L97] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L98] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=-64, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L99] var_1_4 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L100] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L101] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L102] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L102] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L103] var_1_5 = __VERIFIER_nondet_long() [L104] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L104] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L105] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L105] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=256, var_1_7=4, var_1_8=128, var_1_9=10] [L106] var_1_6 = __VERIFIER_nondet_ulong() [L107] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_7=4, var_1_8=128, var_1_9=10] [L107] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_7=4, var_1_8=128, var_1_9=10] [L108] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=4, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=4, var_1_8=128, var_1_9=10] [L108] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=4, var_1_8=128, var_1_9=10] [L109] var_1_7 = __VERIFIER_nondet_ulong() [L110] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=10] [L110] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=10] [L111] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=10] [L111] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=10] [L112] var_1_8 = __VERIFIER_nondet_ulong() [L113] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_9=10] [L113] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_9=10] [L114] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L114] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L115] var_1_10 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L116] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L117] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L117] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L118] var_1_11 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L119] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L120] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L120] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L121] var_1_13 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L122] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_14=7/5, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L123] var_1_14 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L124] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_15=1289/10, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L125] var_1_15 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L126] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_16=799/4, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L127] var_1_16 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L128] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_17=16, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L129] var_1_17 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L130] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L131] CALL assume_abort_if_not(var_1_17 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L131] RET assume_abort_if_not(var_1_17 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=32, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L132] var_1_18 = __VERIFIER_nondet_ushort() [L133] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L133] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L134] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L134] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L135] var_1_19 = __VERIFIER_nondet_ushort() [L136] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L136] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L137] CALL assume_abort_if_not(var_1_19 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L137] RET assume_abort_if_not(var_1_19 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L138] var_1_21 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L139] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L140] var_1_23 = __VERIFIER_nondet_ushort() [L141] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L141] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L142] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L142] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L143] var_1_24 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L144] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L145] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L145] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L146] var_1_26 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L147] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L148] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L161] RET updateVariables() [L162] CALL step() [L51] COND TRUE ((var_1_2 + var_1_3) / var_1_4) == var_1_5 [L52] var_1_1 = (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) + var_1_8) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=0, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L54] COND TRUE ! var_1_10 VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=0, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=10] [L55] COND TRUE ((((var_1_6) > (var_1_2)) ? (var_1_6) : (var_1_2))) >= var_1_1 [L56] var_1_9 = (-16 + var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=0, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L63] COND FALSE !(((var_1_13 - var_1_14) != ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) || var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=0, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L70] COND TRUE var_1_11 > (var_1_12 * (var_1_2 + var_1_7)) [L71] var_1_20 = var_1_21 VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L73] COND FALSE !(var_1_5 > var_1_1) [L84] var_1_22 = var_1_24 VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L86] COND TRUE (var_1_15 / var_1_26) > var_1_13 [L87] var_1_25 = ((((((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) > (2)) ? (((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) : (2))) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_18=0, var_1_19=-65536, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L162] RET step() [L163] CALL, EXPR property() [L153-L154] return ((((((((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_6) : (var_1_7))) + var_1_8))) : 1) && ((! var_1_10) ? ((((((var_1_6) > (var_1_2)) ? (var_1_6) : (var_1_2))) >= var_1_1) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) || var_1_10) ? ((var_1_1 >= var_1_17) ? (var_1_12 == ((unsigned short int) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + 32))) : (var_1_12 == ((unsigned short int) var_1_19))) : 1)) && ((var_1_11 > (var_1_12 * (var_1_2 + var_1_7))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((var_1_5 > var_1_1) ? ((var_1_5 >= (var_1_4 + var_1_3)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_15 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) > (2)) ? (((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_17=0, var_1_18=0, var_1_19=-65536, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET, EXPR property() [L163] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_17=0, var_1_18=0, var_1_19=-65536, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=10000, var_1_17=0, var_1_18=0, var_1_19=-65536, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_2=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 426 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 308 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 862 NumberOfCodeBlocks, 862 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 5040/5040 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-08 19:33:02,151 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_codestructure_normal_file-26.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 1e02c5de11e993114d19017be871476fa0b70a2f3ad74a20775a8f209845e0a0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:33:04,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:33:04,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:33:04,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:33:04,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:33:04,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:33:04,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:33:04,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:33:04,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:33:04,665 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:33:04,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:33:04,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:33:04,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:33:04,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:33:04,671 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:33:04,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:33:04,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:33:04,672 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:33:04,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:33:04,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:33:04,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:33:04,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:33:04,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:33:04,678 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:33:04,678 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:33:04,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:33:04,678 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:33:04,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:33:04,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:33:04,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:33:04,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:33:04,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:33:04,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:33:04,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:33:04,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:33:04,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:33:04,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:33:04,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:33:04,690 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:33:04,690 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:33:04,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:33:04,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:33:04,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:33:04,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:33:04,694 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 -> 1e02c5de11e993114d19017be871476fa0b70a2f3ad74a20775a8f209845e0a0 [2024-11-08 19:33:05,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:33:05,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:33:05,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:33:05,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:33:05,064 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:33:05,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-26.i [2024-11-08 19:33:06,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:33:06,911 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:33:06,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-26.i [2024-11-08 19:33:06,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e70bd15b/cb11327d285d4ec099f9d6c0c8f59ba0/FLAGaed678597 [2024-11-08 19:33:07,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e70bd15b/cb11327d285d4ec099f9d6c0c8f59ba0 [2024-11-08 19:33:07,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:33:07,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:33:07,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:33:07,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:33:07,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:33:07,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6883e194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07, skipping insertion in model container [2024-11-08 19:33:07,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:33:07,522 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_codestructure_normal_file-26.i[913,926] [2024-11-08 19:33:07,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:33:07,637 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:33:07,653 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_codestructure_normal_file-26.i[913,926] [2024-11-08 19:33:07,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:33:07,726 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:33:07,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07 WrapperNode [2024-11-08 19:33:07,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:33:07,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:33:07,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:33:07,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:33:07,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,790 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-08 19:33:07,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:33:07,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:33:07,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:33:07,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:33:07,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,849 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-08 19:33:07,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:33:07,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:33:07,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:33:07,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:33:07,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (1/1) ... [2024-11-08 19:33:07,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:33:07,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:33:07,941 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-08 19:33:07,944 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-08 19:33:07,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:33:07,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:33:07,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:33:07,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:33:07,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:33:07,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:33:08,097 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:33:08,104 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:33:12,172 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:33:12,172 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:33:12,189 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:33:12,189 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:33:12,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:33:12 BoogieIcfgContainer [2024-11-08 19:33:12,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:33:12,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:33:12,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:33:12,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:33:12,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:33:07" (1/3) ... [2024-11-08 19:33:12,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dac147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:33:12, skipping insertion in model container [2024-11-08 19:33:12,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:07" (2/3) ... [2024-11-08 19:33:12,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dac147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:33:12, skipping insertion in model container [2024-11-08 19:33:12,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:33:12" (3/3) ... [2024-11-08 19:33:12,203 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-26.i [2024-11-08 19:33:12,222 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:33:12,223 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:33:12,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:33:12,310 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;@15519600, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:33:12,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:33:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 19:33:12,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:33:12,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:12,339 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:33:12,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:12,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:12,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1388779724, now seen corresponding path program 1 times [2024-11-08 19:33:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:33:12,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354834618] [2024-11-08 19:33:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:12,365 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-08 19:33:12,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:33:12,369 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-08 19:33:12,370 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-08 19:33:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:12,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:33:13,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:33:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2024-11-08 19:33:13,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:33:13,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:33:13,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354834618] [2024-11-08 19:33:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354834618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:33:13,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:33:13,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:33:13,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29358998] [2024-11-08 19:33:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:33:13,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:33:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:33:13,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:33:13,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:33:13,125 INFO L87 Difference]: Start difference. First operand has 85 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-08 19:33:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:33:13,160 INFO L93 Difference]: Finished difference Result 163 states and 296 transitions. [2024-11-08 19:33:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:33:13,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 215 [2024-11-08 19:33:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:33:13,171 INFO L225 Difference]: With dead ends: 163 [2024-11-08 19:33:13,171 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 19:33:13,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 214 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-08 19:33:13,181 INFO L432 NwaCegarLoop]: 126 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, 126 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-08 19:33:13,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:33:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 19:33:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 19:33:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 19:33:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2024-11-08 19:33:13,247 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 215 [2024-11-08 19:33:13,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:33:13,249 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2024-11-08 19:33:13,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-08 19:33:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2024-11-08 19:33:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:33:13,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:13,254 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:33:13,275 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-08 19:33:13,455 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-08 19:33:13,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:13,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1271238724, now seen corresponding path program 1 times [2024-11-08 19:33:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:33:13,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454040580] [2024-11-08 19:33:13,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:13,458 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-08 19:33:13,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:33:13,461 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-08 19:33:13,462 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-08 19:33:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:33:14,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:33:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:33:14,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:33:14,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:33:14,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454040580] [2024-11-08 19:33:14,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454040580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:33:14,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:33:14,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:33:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921713722] [2024-11-08 19:33:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:33:14,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:33:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:33:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:33:14,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:33:14,076 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 19:33:17,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:33:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:33:17,797 INFO L93 Difference]: Finished difference Result 200 states and 311 transitions. [2024-11-08 19:33:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:33:17,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 215 [2024-11-08 19:33:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:33:17,802 INFO L225 Difference]: With dead ends: 200 [2024-11-08 19:33:17,802 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 19:33:17,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:33:17,806 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 60 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:33:17,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 299 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-08 19:33:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 19:33:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2024-11-08 19:33:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 66 states have internal predecessors, (83), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 19:33:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 185 transitions. [2024-11-08 19:33:17,834 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 185 transitions. Word has length 215 [2024-11-08 19:33:17,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:33:17,835 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 185 transitions. [2024-11-08 19:33:17,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 19:33:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 185 transitions. [2024-11-08 19:33:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 19:33:17,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:17,840 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:33:17,862 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 (3)] Ended with exit code 0 [2024-11-08 19:33:18,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-08 19:33:18,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:18,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash -376993936, now seen corresponding path program 1 times [2024-11-08 19:33:18,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:33:18,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678186621] [2024-11-08 19:33:18,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:18,043 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-08 19:33:18,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:33:18,045 INFO L229 MonitoredProcess]: Starting monitored process 4 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-08 19:33:18,047 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 (4)] Waiting until timeout for monitored process [2024-11-08 19:33:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:18,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 19:33:18,558 INFO L278 TraceCheckSpWp]: Computing forward predicates...