./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:11:38,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:11:38,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:11:38,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:11:38,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:11:38,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:11:38,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:11:38,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:11:38,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:11:38,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:11:38,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:11:38,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:11:38,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:11:38,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:11:38,748 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:11:38,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:11:38,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:11:38,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:11:38,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:11:38,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:11:38,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:11:38,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:11:38,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:11:38,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:11:38,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:11:38,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:11:38,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:11:38,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:11:38,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:11:38,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:11:38,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:11:38,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:11:38,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:11:38,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:11:38,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:11:38,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:11:38,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:11:38,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:11:38,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:11:38,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:11:38,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:11:38,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:11:38,760 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-clean/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-clean/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 -> cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 [2024-10-11 11:11:39,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:11:39,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:11:39,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:11:39,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:11:39,063 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:11:39,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-10-11 11:11:40,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:11:40,786 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:11:40,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-10-11 11:11:40,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/23765bc59/877d80f407b34444ba1355c38ed29332/FLAG295793f9c [2024-10-11 11:11:40,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/23765bc59/877d80f407b34444ba1355c38ed29332 [2024-10-11 11:11:40,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:11:40,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:11:40,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:11:40,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:11:40,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:11:40,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:11:40" (1/1) ... [2024-10-11 11:11:40,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e6b0f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:40, skipping insertion in model container [2024-10-11 11:11:40,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:11:40" (1/1) ... [2024-10-11 11:11:40,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:11:41,062 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i[915,928] [2024-10-11 11:11:41,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:11:41,186 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:11:41,198 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i[915,928] [2024-10-11 11:11:41,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:11:41,268 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:11:41,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41 WrapperNode [2024-10-11 11:11:41,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:11:41,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:11:41,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:11:41,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:11:41,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,373 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2024-10-11 11:11:41,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:11:41,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:11:41,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:11:41,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:11:41,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,439 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:11:41,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:11:41,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:11:41,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:11:41,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:11:41,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (1/1) ... [2024-10-11 11:11:41,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:11:41,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:11:41,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:11:41,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:11:41,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:11:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:11:41,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:11:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:11:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:11:41,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:11:41,702 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:11:41,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:11:42,349 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 11:11:42,351 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:11:42,386 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:11:42,387 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:11:42,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:11:42 BoogieIcfgContainer [2024-10-11 11:11:42,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:11:42,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:11:42,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:11:42,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:11:42,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:11:40" (1/3) ... [2024-10-11 11:11:42,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d575cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:11:42, skipping insertion in model container [2024-10-11 11:11:42,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:41" (2/3) ... [2024-10-11 11:11:42,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d575cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:11:42, skipping insertion in model container [2024-10-11 11:11:42,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:11:42" (3/3) ... [2024-10-11 11:11:42,399 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-10-11 11:11:42,414 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:11:42,414 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:11:42,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:11:42,495 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;@11e6a377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:11:42,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:11:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 73 states have (on average 1.547945205479452) internal successors, (113), 74 states have internal predecessors, (113), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:11:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 11:11:42,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:42,518 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:42,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:42,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:42,525 INFO L85 PathProgramCache]: Analyzing trace with hash -244575480, now seen corresponding path program 1 times [2024-10-11 11:11:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:11:42,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054521192] [2024-10-11 11:11:42,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:11:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:11:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:11:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:11:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:11:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:11:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:11:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:11:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:11:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:11:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:11:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:11:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:11:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:11:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:42,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:11:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:11:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:11:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:11:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:11:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:11:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:11:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:11:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:11:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:11:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:11:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:11:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:11:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:11:43,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:11:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054521192] [2024-10-11 11:11:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054521192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:11:43,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:11:43,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:11:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075337236] [2024-10-11 11:11:43,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:11:43,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:11:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:11:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:11:43,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:11:43,185 INFO L87 Difference]: Start difference. First operand has 102 states, 73 states have (on average 1.547945205479452) internal successors, (113), 74 states have internal predecessors, (113), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 11:11:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:43,250 INFO L93 Difference]: Finished difference Result 202 states and 353 transitions. [2024-10-11 11:11:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:11:43,252 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2024-10-11 11:11:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:43,261 INFO L225 Difference]: With dead ends: 202 [2024-10-11 11:11:43,262 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 11:11:43,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:11:43,273 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:43,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:11:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 11:11:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 11:11:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 states have internal predecessors, (102), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:11:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 154 transitions. [2024-10-11 11:11:43,336 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 154 transitions. Word has length 167 [2024-10-11 11:11:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:43,337 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 154 transitions. [2024-10-11 11:11:43,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 11:11:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 154 transitions. [2024-10-11 11:11:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 11:11:43,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:43,344 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:43,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:11:43,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:43,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1366499664, now seen corresponding path program 1 times [2024-10-11 11:11:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:11:43,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183188244] [2024-10-11 11:11:43,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:11:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:11:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:11:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:11:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:11:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:11:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:11:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:11:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:11:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:11:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:11:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:11:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:11:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:11:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:11:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:11:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:11:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:11:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:11:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:11:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:11:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:11:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:11:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:11:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:11:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:11:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:11:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:11:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:11:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183188244] [2024-10-11 11:11:43,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183188244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:11:43,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:11:43,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:11:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752315002] [2024-10-11 11:11:43,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:11:43,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:11:43,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:11:43,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:11:43,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:11:43,726 INFO L87 Difference]: Start difference. First operand 99 states and 154 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:11:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:43,851 INFO L93 Difference]: Finished difference Result 239 states and 368 transitions. [2024-10-11 11:11:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:11:43,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-10-11 11:11:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:43,857 INFO L225 Difference]: With dead ends: 239 [2024-10-11 11:11:43,857 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 11:11:43,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-10-11 11:11:43,860 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 73 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:43,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 294 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:11:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 11:11:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-10-11 11:11:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 107 states have (on average 1.411214953271028) internal successors, (151), 108 states have internal predecessors, (151), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:11:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 207 transitions. [2024-10-11 11:11:43,888 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 207 transitions. Word has length 167 [2024-10-11 11:11:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:43,890 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 207 transitions. [2024-10-11 11:11:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:11:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 207 transitions. [2024-10-11 11:11:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 11:11:43,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:43,895 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:43,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:11:43,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:43,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash -293247205, now seen corresponding path program 1 times [2024-10-11 11:11:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:11:43,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165198579] [2024-10-11 11:11:43,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:11:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:11:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:11:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:11:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:11:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:11:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:11:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:11:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:11:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:11:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:11:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:11:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:11:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:11:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:11:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:11:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:11:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:11:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:11:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:11:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:11:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:11:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:11:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:11:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:11:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:11:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:11:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:11:44,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:11:44,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165198579] [2024-10-11 11:11:44,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165198579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:11:44,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:11:44,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:11:44,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115293089] [2024-10-11 11:11:44,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:11:44,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:11:44,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:11:44,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:11:44,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:11:44,359 INFO L87 Difference]: Start difference. First operand 138 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:11:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:44,530 INFO L93 Difference]: Finished difference Result 407 states and 613 transitions. [2024-10-11 11:11:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:11:44,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-10-11 11:11:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:44,538 INFO L225 Difference]: With dead ends: 407 [2024-10-11 11:11:44,541 INFO L226 Difference]: Without dead ends: 270 [2024-10-11 11:11:44,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:11:44,543 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 117 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:44,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 443 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:11:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-11 11:11:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 185. [2024-10-11 11:11:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 128 states have internal predecessors, (172), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 11:11:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 280 transitions. [2024-10-11 11:11:44,594 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 280 transitions. Word has length 168 [2024-10-11 11:11:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:44,595 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 280 transitions. [2024-10-11 11:11:44,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:11:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 280 transitions. [2024-10-11 11:11:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 11:11:44,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:44,598 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:44,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:11:44,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:44,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash -605983003, now seen corresponding path program 1 times [2024-10-11 11:11:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:11:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417958412] [2024-10-11 11:11:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:11:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:11:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:11:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:11:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:11:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:11:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:11:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:11:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:11:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:11:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:11:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:11:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:11:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:11:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:11:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:11:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:11:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:11:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:11:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:11:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:11:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:11:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:11:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:11:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:11:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:11:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:11:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:11:44,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:11:44,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417958412] [2024-10-11 11:11:44,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417958412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:11:44,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:11:44,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:11:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721441468] [2024-10-11 11:11:44,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:11:44,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:11:44,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:11:44,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:11:44,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:11:44,802 INFO L87 Difference]: Start difference. First operand 185 states and 280 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:11:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:44,849 INFO L93 Difference]: Finished difference Result 459 states and 692 transitions. [2024-10-11 11:11:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:11:44,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-11 11:11:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:44,854 INFO L225 Difference]: With dead ends: 459 [2024-10-11 11:11:44,854 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 11:11:44,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-10-11 11:11:44,856 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 103 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:44,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 291 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:11:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 11:11:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2024-10-11 11:11:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 234 states have internal predecessors, (317), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-11 11:11:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 481 transitions. [2024-10-11 11:11:44,906 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 481 transitions. Word has length 169 [2024-10-11 11:11:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:44,907 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 481 transitions. [2024-10-11 11:11:44,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:11:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 481 transitions. [2024-10-11 11:11:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 11:11:44,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:44,910 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:44,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:11:44,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:44,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash 371185020, now seen corresponding path program 1 times [2024-10-11 11:11:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:11:44,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951070857] [2024-10-11 11:11:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:11:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:11:45,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175311316] [2024-10-11 11:11:45,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:45,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:11:45,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:11:45,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:11:45,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:11:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:11:45,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:11:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:11:45,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:11:45,524 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:11:45,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:11:45,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:11:45,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:11:45,731 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 11:11:45,853 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:11:45,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:11:45 BoogieIcfgContainer [2024-10-11 11:11:45,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:11:45,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:11:45,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:11:45,857 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:11:45,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:11:42" (3/4) ... [2024-10-11 11:11:45,859 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:11:45,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:11:45,861 INFO L158 Benchmark]: Toolchain (without parser) took 5040.09ms. Allocated memory was 153.1MB in the beginning and 207.6MB in the end (delta: 54.5MB). Free memory was 112.5MB in the beginning and 106.1MB in the end (delta: 6.4MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2024-10-11 11:11:45,861 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:11:45,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.52ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 94.8MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:11:45,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.95ms. Allocated memory is still 153.1MB. Free memory was 94.8MB in the beginning and 87.1MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:11:45,865 INFO L158 Benchmark]: Boogie Preprocessor took 133.58ms. Allocated memory is still 153.1MB. Free memory was 87.1MB in the beginning and 79.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 11:11:45,866 INFO L158 Benchmark]: RCFGBuilder took 879.68ms. Allocated memory is still 153.1MB. Free memory was 79.0MB in the beginning and 84.4MB in the end (delta: -5.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:11:45,866 INFO L158 Benchmark]: TraceAbstraction took 3465.11ms. Allocated memory was 153.1MB in the beginning and 207.6MB in the end (delta: 54.5MB). Free memory was 83.7MB in the beginning and 106.1MB in the end (delta: -22.4MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2024-10-11 11:11:45,866 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 207.6MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:11:45,867 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.17ms. Allocated memory is still 100.7MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.52ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 94.8MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.95ms. Allocated memory is still 153.1MB. Free memory was 94.8MB in the beginning and 87.1MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.58ms. Allocated memory is still 153.1MB. Free memory was 87.1MB in the beginning and 79.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 879.68ms. Allocated memory is still 153.1MB. Free memory was 79.0MB in the beginning and 84.4MB in the end (delta: -5.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3465.11ms. Allocated memory was 153.1MB in the beginning and 207.6MB in the end (delta: 54.5MB). Free memory was 83.7MB in the beginning and 106.1MB in the end (delta: -22.4MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 207.6MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 199, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -128; [L23] double var_1_4 = 99999999999.6; [L24] unsigned char var_1_5 = 1; [L25] signed long int var_1_6 = -5; [L26] signed char var_1_10 = 64; [L27] signed char var_1_11 = 16; [L28] signed char var_1_12 = 4; [L29] signed char var_1_13 = 64; [L30] unsigned short int var_1_14 = 64; [L31] unsigned char var_1_16 = 8; [L32] unsigned char var_1_17 = 200; [L33] unsigned char var_1_18 = 1; [L34] signed long int var_1_19 = 10; [L35] signed long int var_1_20 = -256; [L36] signed char var_1_21 = 25; [L37] signed char var_1_23 = 1; [L38] signed char var_1_24 = 5; [L39] unsigned char var_1_25 = 0; [L40] double var_1_26 = 8.125; [L41] double var_1_27 = 0.875; [L42] double var_1_28 = 15.6; [L43] double var_1_29 = 2.5; [L44] unsigned long int var_1_30 = 25; [L45] signed long int var_1_31 = 50; [L46] signed short int var_1_32 = -8; [L47] unsigned char var_1_33 = 100; [L48] signed long int last_1_var_1_6 = -5; [L49] signed long int last_1_var_1_20 = -256; [L50] signed char last_1_var_1_21 = 25; [L203] isInitial = 1 [L204] FCALL initially() [L205] int k_loop; [L206] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L206] COND TRUE k_loop < 1 [L207] CALL updateLastVariables() [L194] last_1_var_1_6 = var_1_6 [L195] last_1_var_1_20 = var_1_20 [L196] last_1_var_1_21 = var_1_21 [L207] RET updateLastVariables() [L208] CALL updateVariables() [L152] var_1_4 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L153] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L154] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L154] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L155] var_1_5 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L156] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L157] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L157] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L158] var_1_11 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L159] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L160] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L160] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L161] var_1_12 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L162] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L163] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L163] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L164] var_1_13 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L165] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L166] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L166] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L167] var_1_17 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_17 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L168] RET assume_abort_if_not(var_1_17 >= 190) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L169] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L169] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L170] var_1_18 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L171] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L172] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L172] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L173] var_1_23 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L174] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L175] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L175] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L176] var_1_24 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L177] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L178] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L178] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L180] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L182] var_1_27 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L183] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L184] var_1_28 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L185] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L186] var_1_29 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L187] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L188] var_1_31 = __VERIFIER_nondet_long() [L189] CALL assume_abort_if_not(var_1_31 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L189] RET assume_abort_if_not(var_1_31 >= -2147483648) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L190] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L190] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L191] CALL assume_abort_if_not(var_1_31 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L191] RET assume_abort_if_not(var_1_31 != 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L208] RET updateVariables() [L209] CALL step() [L54] COND TRUE \read(var_1_5) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L55] COND TRUE (last_1_var_1_6 < 1) || var_1_25 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L56] COND TRUE \read(var_1_25) [L57] var_1_26 = ((var_1_27 - var_1_28) + var_1_29) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L65] COND FALSE !((- var_1_26) >= (var_1_26 / var_1_4)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L70] var_1_32 = var_1_23 [L71] var_1_33 = var_1_18 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-5] [L72] COND FALSE !(! var_1_5) [L87] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-5] [L89] COND FALSE !(var_1_1 == 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-5] [L92] COND FALSE !(var_1_14 < var_1_1) [L95] var_1_6 = var_1_1 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L98] unsigned short int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=8, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L99] COND FALSE !(! var_1_5) [L104] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L106] var_1_19 = var_1_16 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L107] COND FALSE !(((-32 + var_1_33) / var_1_17) >= ((var_1_13 - var_1_33) / var_1_31)) [L114] var_1_30 = var_1_33 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L116] COND TRUE \read(var_1_5) [L117] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L125] COND TRUE \read(var_1_5) [L126] var_1_20 = -10000000 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L142] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L143] EXPR last_1_var_1_21 & var_1_10 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L143] COND TRUE ((last_1_var_1_21 & var_1_10) >= var_1_12) && stepLocal_1 [L144] var_1_21 = (var_1_18 + (var_1_23 - var_1_24)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L209] RET step() [L210] CALL, EXPR property() [L199] EXPR ((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14)))) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L199] EXPR (((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14))))) && ((((last_1_var_1_21 & var_1_10) >= var_1_12) && var_1_5) ? (var_1_21 == ((signed char) (var_1_18 + (var_1_23 - var_1_24)))) : ((! var_1_25) ? (var_1_21 == ((signed char) var_1_17)) : 1)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L199-L200] return (((((((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14))))) && ((((last_1_var_1_21 & var_1_10) >= var_1_12) && var_1_5) ? (var_1_21 == ((signed char) (var_1_18 + (var_1_23 - var_1_24)))) : ((! var_1_25) ? (var_1_21 == ((signed char) var_1_17)) : 1))) && (var_1_5 ? (((last_1_var_1_6 < 1) || var_1_25) ? (var_1_25 ? (var_1_26 == ((double) ((var_1_27 - var_1_28) + var_1_29))) : 1) : (var_1_26 == ((double) var_1_28))) : (var_1_26 == ((double) var_1_28)))) && ((((-32 + var_1_33) / var_1_17) >= ((var_1_13 - var_1_33) / var_1_31)) ? ((var_1_16 > var_1_16) ? (var_1_30 == ((unsigned long int) var_1_18)) : (var_1_30 == ((unsigned long int) var_1_17))) : (var_1_30 == ((unsigned long int) var_1_33)))) && (var_1_32 == ((signed short int) var_1_23))) && (var_1_33 == ((unsigned char) var_1_18)) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=-1, var_1_13=36, var_1_14=36, var_1_16=-223, var_1_17=-66, var_1_18=-223, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=-223, var_1_5=1, var_1_6=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 1179 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 544 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 635 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 90 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1011 NumberOfCodeBlocks, 1011 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 667 ConstructedInterpolants, 0 QuantifiedInterpolants, 1049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 5200/5200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:11:45,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:11:48,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:11:48,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:11:48,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:11:48,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:11:48,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:11:48,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:11:48,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:11:48,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:11:48,253 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:11:48,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:11:48,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:11:48,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:11:48,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:11:48,257 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:11:48,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:11:48,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:11:48,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:11:48,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:11:48,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:11:48,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:11:48,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:11:48,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:11:48,263 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:11:48,263 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:11:48,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:11:48,264 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:11:48,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:11:48,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:11:48,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:11:48,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:11:48,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:11:48,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:11:48,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:11:48,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:11:48,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:11:48,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:11:48,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:11:48,278 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:11:48,278 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:11:48,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:11:48,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:11:48,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:11:48,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:11:48,280 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:11:48,280 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-clean/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-clean/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 -> cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 [2024-10-11 11:11:48,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:11:48,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:11:48,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:11:48,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:11:48,628 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:11:48,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-10-11 11:11:50,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:11:50,615 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:11:50,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-10-11 11:11:50,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/721fa548b/008337764845471a824a8a43e58fc6e2/FLAG85dadcab7 [2024-10-11 11:11:50,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/721fa548b/008337764845471a824a8a43e58fc6e2 [2024-10-11 11:11:50,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:11:50,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:11:50,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:11:50,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:11:50,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:11:50,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:11:50" (1/1) ... [2024-10-11 11:11:50,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e16af9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:50, skipping insertion in model container [2024-10-11 11:11:50,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:11:50" (1/1) ... [2024-10-11 11:11:50,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:11:50,892 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i[915,928] [2024-10-11 11:11:51,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:11:51,018 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:11:51,033 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i[915,928] [2024-10-11 11:11:51,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:11:51,136 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:11:51,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51 WrapperNode [2024-10-11 11:11:51,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:11:51,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:11:51,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:11:51,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:11:51,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,208 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-11 11:11:51,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:11:51,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:11:51,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:11:51,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:11:51,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,260 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:11:51,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:11:51,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:11:51,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:11:51,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:11:51,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (1/1) ... [2024-10-11 11:11:51,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:11:51,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:11:51,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:11:51,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:11:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:11:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:11:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:11:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:11:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:11:51,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:11:51,512 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:11:51,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:12:02,027 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 11:12:02,028 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:12:02,118 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:12:02,118 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:12:02,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:12:02 BoogieIcfgContainer [2024-10-11 11:12:02,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:12:02,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:12:02,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:12:02,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:12:02,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:11:50" (1/3) ... [2024-10-11 11:12:02,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f6af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:12:02, skipping insertion in model container [2024-10-11 11:12:02,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:51" (2/3) ... [2024-10-11 11:12:02,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f6af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:12:02, skipping insertion in model container [2024-10-11 11:12:02,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:12:02" (3/3) ... [2024-10-11 11:12:02,130 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-10-11 11:12:02,145 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:12:02,146 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:12:02,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:12:02,239 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;@1e2e0661, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:12:02,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:12:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:12:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:12:02,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:12:02,260 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:12:02,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:12:02,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:12:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1691035286, now seen corresponding path program 1 times [2024-10-11 11:12:02,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:12:02,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62486069] [2024-10-11 11:12:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:12:02,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:12:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:12:02,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:12:02,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:12:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:12:03,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:12:03,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:12:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-10-11 11:12:03,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:12:03,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:12:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62486069] [2024-10-11 11:12:03,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62486069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:12:03,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:12:03,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:12:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541537062] [2024-10-11 11:12:03,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:12:03,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:12:03,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:12:03,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:12:03,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:12:03,307 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 11:12:07,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:12:07,768 INFO L93 Difference]: Finished difference Result 158 states and 285 transitions. [2024-10-11 11:12:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:12:07,770 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-10-11 11:12:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:12:07,777 INFO L225 Difference]: With dead ends: 158 [2024-10-11 11:12:07,777 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 11:12:07,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:12:07,783 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:12:07,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 11:12:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 11:12:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 11:12:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:12:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-10-11 11:12:07,823 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 162 [2024-10-11 11:12:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:12:07,823 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-10-11 11:12:07,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 11:12:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-10-11 11:12:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:12:07,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:12:07,827 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:12:07,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:12:08,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:12:08,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:12:08,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:12:08,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1166016990, now seen corresponding path program 1 times [2024-10-11 11:12:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:12:08,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80671509] [2024-10-11 11:12:08,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:12:08,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:12:08,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:12:08,034 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:12:08,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:12:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:12:08,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:12:08,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:12:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:12:09,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:12:09,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:12:09,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80671509] [2024-10-11 11:12:09,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80671509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:12:09,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:12:09,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:12:09,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654528882] [2024-10-11 11:12:09,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:12:09,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:12:09,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:12:09,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:12:09,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:12:09,298 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:12:13,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:17,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:21,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:12:22,062 INFO L93 Difference]: Finished difference Result 182 states and 280 transitions. [2024-10-11 11:12:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:12:22,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-10-11 11:12:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:12:22,066 INFO L225 Difference]: With dead ends: 182 [2024-10-11 11:12:22,067 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 11:12:22,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:12:22,071 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 37 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:12:22,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 227 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2024-10-11 11:12:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 11:12:22,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-11 11:12:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 73 states have internal predecessors, (98), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:12:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2024-10-11 11:12:22,100 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 162 [2024-10-11 11:12:22,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:12:22,101 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2024-10-11 11:12:22,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:12:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2024-10-11 11:12:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 11:12:22,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:12:22,107 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:12:22,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:12:22,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:12:22,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:12:22,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:12:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash 565018571, now seen corresponding path program 1 times [2024-10-11 11:12:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:12:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702467440] [2024-10-11 11:12:22,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:12:22,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:12:22,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:12:22,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:12:22,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:12:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:12:23,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:12:23,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:12:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:12:27,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:12:27,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:12:27,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702467440] [2024-10-11 11:12:27,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702467440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:12:27,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:12:27,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:12:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530346135] [2024-10-11 11:12:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:12:27,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:12:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:12:27,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:12:27,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:12:27,729 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:12:32,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:36,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:40,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:44,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:48,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:12:49,001 INFO L93 Difference]: Finished difference Result 302 states and 454 transitions. [2024-10-11 11:12:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:12:49,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2024-10-11 11:12:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:12:49,006 INFO L225 Difference]: With dead ends: 302 [2024-10-11 11:12:49,006 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 11:12:49,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:12:49,008 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 80 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:12:49,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 342 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 21.1s Time] [2024-10-11 11:12:49,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 11:12:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 150. [2024-10-11 11:12:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 93 states have internal predecessors, (119), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 11:12:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2024-10-11 11:12:49,054 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 163 [2024-10-11 11:12:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:12:49,055 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2024-10-11 11:12:49,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:12:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2024-10-11 11:12:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 11:12:49,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:12:49,064 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:12:49,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 11:12:49,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:12:49,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:12:49,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:12:49,266 INFO L85 PathProgramCache]: Analyzing trace with hash 475140589, now seen corresponding path program 1 times [2024-10-11 11:12:49,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:12:49,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363019168] [2024-10-11 11:12:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:12:49,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:12:49,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:12:49,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:12:49,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (5)] Waiting until timeout for monitored process [2024-10-11 11:12:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:12:50,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:12:50,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:12:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:12:54,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:12:54,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:12:54,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363019168] [2024-10-11 11:12:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363019168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:12:54,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:12:54,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:12:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424584242] [2024-10-11 11:12:54,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:12:54,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:12:54,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:12:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:12:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:12:54,284 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:12:58,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:13:02,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:13:06,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:13:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:13:06,824 INFO L93 Difference]: Finished difference Result 354 states and 533 transitions. [2024-10-11 11:13:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:13:06,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-10-11 11:13:06,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:13:06,829 INFO L225 Difference]: With dead ends: 354 [2024-10-11 11:13:06,829 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 11:13:06,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:13:06,831 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 40 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:13:06,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 225 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2024-10-11 11:13:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 11:13:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2024-10-11 11:13:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 164 states have internal predecessors, (211), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-11 11:13:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2024-10-11 11:13:06,872 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 164 [2024-10-11 11:13:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:13:06,872 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2024-10-11 11:13:06,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:13:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2024-10-11 11:13:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 11:13:06,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:13:06,877 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:13:06,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (5)] Forceful destruction successful, exit code 0 [2024-10-11 11:13:07,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:13:07,078 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:13:07,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:13:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2069373366, now seen corresponding path program 1 times [2024-10-11 11:13:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:13:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918149843] [2024-10-11 11:13:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:13:07,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:13:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:13:07,080 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:13:07,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Waiting until timeout for monitored process [2024-10-11 11:13:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:08,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 11:13:08,313 INFO L278 TraceCheckSpWp]: Computing forward predicates...