./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_fillercode_fillercodestructure_filler-ps-ci_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da4df5dd1fae50c8c45db2adce0db91c4abebe1be827a98b4c34c4c101f7143b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:40:17,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:40:18,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:40:18,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:40:18,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:40:18,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:40:18,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:40:18,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:40:18,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:40:18,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:40:18,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:40:18,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:40:18,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:40:18,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:40:18,117 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:40:18,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:40:18,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:40:18,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:40:18,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:40:18,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:40:18,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:40:18,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:40:18,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:40:18,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:40:18,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:40:18,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:40:18,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:40:18,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:40:18,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:40:18,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:40:18,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:40:18,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:40:18,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:40:18,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:40:18,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:40:18,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:40:18,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:40:18,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:40:18,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:40:18,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:40:18,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:40:18,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:40:18,128 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da4df5dd1fae50c8c45db2adce0db91c4abebe1be827a98b4c34c4c101f7143b [2024-10-13 02:40:18,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:40:18,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:40:18,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:40:18,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:40:18,417 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:40:18,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-10-13 02:40:19,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:40:20,161 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:40:20,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-10-13 02:40:20,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9b11407/c18d5bb9c83740fdacd77c3061e5d31e/FLAG68fabb065 [2024-10-13 02:40:20,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9b11407/c18d5bb9c83740fdacd77c3061e5d31e [2024-10-13 02:40:20,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:40:20,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:40:20,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:40:20,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:40:20,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:40:20,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3520033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20, skipping insertion in model container [2024-10-13 02:40:20,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:40:20,437 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_fillercode_fillercodestructure_filler-ps-ci_file-26.i[919,932] [2024-10-13 02:40:20,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:40:20,525 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:40:20,538 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_fillercode_fillercodestructure_filler-ps-ci_file-26.i[919,932] [2024-10-13 02:40:20,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:40:20,611 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:40:20,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20 WrapperNode [2024-10-13 02:40:20,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:40:20,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:40:20,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:40:20,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:40:20,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,676 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-13 02:40:20,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:40:20,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:40:20,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:40:20,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:40:20,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,724 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-13 02:40:20,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:40:20,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:40:20,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:40:20,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:40:20,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (1/1) ... [2024-10-13 02:40:20,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:40:20,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:40:20,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:40:20,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:40:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:40:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:40:20,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:40:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:40:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:40:20,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:40:20,979 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:40:20,982 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:40:21,447 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 02:40:21,448 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:40:21,506 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:40:21,507 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:40:21,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:40:21 BoogieIcfgContainer [2024-10-13 02:40:21,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:40:21,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:40:21,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:40:21,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:40:21,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:40:20" (1/3) ... [2024-10-13 02:40:21,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722a9973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:40:21, skipping insertion in model container [2024-10-13 02:40:21,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:20" (2/3) ... [2024-10-13 02:40:21,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722a9973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:40:21, skipping insertion in model container [2024-10-13 02:40:21,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:40:21" (3/3) ... [2024-10-13 02:40:21,521 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-10-13 02:40:21,539 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:40:21,539 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:40:21,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:40:21,627 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;@5101b73a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:40:21,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:40:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:40:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-13 02:40:21,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:40:21,656 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:40:21,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:40:21,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:40:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash -964171668, now seen corresponding path program 1 times [2024-10-13 02:40:21,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:40:21,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418842081] [2024-10-13 02:40:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:21,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:40:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:40:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:40:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:40:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:40:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:40:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:40:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:40:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:40:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:40:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:40:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:40:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:40:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:40:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:40:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:40:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:40:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:40:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:40:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:40:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:40:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:40:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:40:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:40:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:40:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:40:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:40:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:40:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:40:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:40:22,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:40:22,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418842081] [2024-10-13 02:40:22,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418842081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:40:22,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:40:22,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:40:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882568058] [2024-10-13 02:40:22,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:40:22,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:40:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:40:22,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:40:22,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:40:22,367 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:40:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:40:22,414 INFO L93 Difference]: Finished difference Result 161 states and 296 transitions. [2024-10-13 02:40:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:40:22,417 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), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-13 02:40:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:40:22,430 INFO L225 Difference]: With dead ends: 161 [2024-10-13 02:40:22,430 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 02:40:22,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 58 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-13 02:40:22,441 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:40:22,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:40:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 02:40:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 02:40:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:40:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2024-10-13 02:40:22,497 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 176 [2024-10-13 02:40:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:40:22,499 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2024-10-13 02:40:22,499 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), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:40:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2024-10-13 02:40:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-13 02:40:22,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:40:22,503 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:40:22,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:40:22,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:40:22,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:40:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1336650922, now seen corresponding path program 1 times [2024-10-13 02:40:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:40:22,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211914677] [2024-10-13 02:40:22,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:40:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:40:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:40:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:40:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:40:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:40:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:40:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:40:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:40:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:40:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:40:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:40:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:40:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:40:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:40:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:40:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:40:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:40:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:40:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:40:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:40:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:40:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:40:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:40:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:40:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:40:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:40:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:40:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:40:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:40:23,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:40:23,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211914677] [2024-10-13 02:40:23,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211914677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:40:23,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:40:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:40:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762301282] [2024-10-13 02:40:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:40:23,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:40:23,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:40:23,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:40:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:40:23,354 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:40:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:40:23,505 INFO L93 Difference]: Finished difference Result 194 states and 309 transitions. [2024-10-13 02:40:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:40:23,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-13 02:40:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:40:23,511 INFO L225 Difference]: With dead ends: 194 [2024-10-13 02:40:23,511 INFO L226 Difference]: Without dead ends: 115 [2024-10-13 02:40:23,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:40:23,514 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 42 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:40:23,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 275 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:40:23,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-13 02:40:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-10-13 02:40:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-13 02:40:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 175 transitions. [2024-10-13 02:40:23,545 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 175 transitions. Word has length 176 [2024-10-13 02:40:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:40:23,546 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 175 transitions. [2024-10-13 02:40:23,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:40:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 175 transitions. [2024-10-13 02:40:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-13 02:40:23,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:40:23,552 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:40:23,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:40:23,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:40:23,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:40:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1811455266, now seen corresponding path program 1 times [2024-10-13 02:40:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:40:23,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88784322] [2024-10-13 02:40:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:40:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:40:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:40:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:40:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:40:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:40:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:40:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:40:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:40:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:40:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:40:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:40:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:40:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:40:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:40:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:40:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:40:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:40:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:40:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:40:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:40:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:40:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:40:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:40:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:40:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:40:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:40:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:40:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:40:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:40:24,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:40:24,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88784322] [2024-10-13 02:40:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88784322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:40:24,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:40:24,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:40:24,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998663223] [2024-10-13 02:40:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:40:24,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:40:24,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:40:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:40:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:40:24,166 INFO L87 Difference]: Start difference. First operand 112 states and 175 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:40:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:40:24,516 INFO L93 Difference]: Finished difference Result 341 states and 534 transitions. [2024-10-13 02:40:24,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:40:24,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-13 02:40:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:40:24,523 INFO L225 Difference]: With dead ends: 341 [2024-10-13 02:40:24,525 INFO L226 Difference]: Without dead ends: 230 [2024-10-13 02:40:24,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:40:24,528 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 130 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:40:24,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 429 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:40:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-13 02:40:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 202. [2024-10-13 02:40:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 139 states have (on average 1.4388489208633093) internal successors, (200), 140 states have internal predecessors, (200), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-13 02:40:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 318 transitions. [2024-10-13 02:40:24,587 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 318 transitions. Word has length 177 [2024-10-13 02:40:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:40:24,591 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 318 transitions. [2024-10-13 02:40:24,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:40:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 318 transitions. [2024-10-13 02:40:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-13 02:40:24,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:40:24,594 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:40:24,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:40:24,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:40:24,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:40:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2090485020, now seen corresponding path program 1 times [2024-10-13 02:40:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:40:24,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873612347] [2024-10-13 02:40:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:40:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:40:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:40:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:40:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:40:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:40:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:40:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:40:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:40:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:40:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:40:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:40:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:40:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:40:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:40:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:40:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:40:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:40:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:40:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:40:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:40:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:40:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:40:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:40:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:40:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:40:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:40:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:40:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:40:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 02:40:24,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:40:24,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873612347] [2024-10-13 02:40:24,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873612347] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:40:24,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347880898] [2024-10-13 02:40:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:24,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:40:24,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:40:24,944 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:40:24,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:40:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:25,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:40:25,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:40:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 363 proven. 9 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2024-10-13 02:40:25,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:40:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 02:40:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347880898] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:40:25,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:40:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 02:40:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721867050] [2024-10-13 02:40:25,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:40:25,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:40:25,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:40:25,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:40:25,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:40:25,486 INFO L87 Difference]: Start difference. First operand 202 states and 318 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:40:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:40:25,899 INFO L93 Difference]: Finished difference Result 455 states and 709 transitions. [2024-10-13 02:40:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:40:25,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 177 [2024-10-13 02:40:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:40:25,903 INFO L225 Difference]: With dead ends: 455 [2024-10-13 02:40:25,904 INFO L226 Difference]: Without dead ends: 254 [2024-10-13 02:40:25,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:40:25,909 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 200 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:40:25,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 287 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:40:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-13 02:40:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 247. [2024-10-13 02:40:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 158 states have (on average 1.360759493670886) internal successors, (215), 160 states have internal predecessors, (215), 83 states have call successors, (83), 5 states have call predecessors, (83), 5 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-13 02:40:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 381 transitions. [2024-10-13 02:40:25,960 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 381 transitions. Word has length 177 [2024-10-13 02:40:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:40:25,962 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 381 transitions. [2024-10-13 02:40:25,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:40:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 381 transitions. [2024-10-13 02:40:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 02:40:25,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:40:25,967 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:40:25,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:40:26,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:40:26,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:40:26,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:40:26,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1844234705, now seen corresponding path program 1 times [2024-10-13 02:40:26,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:40:26,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411332084] [2024-10-13 02:40:26,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:26,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:40:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:40:26,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354432923] [2024-10-13 02:40:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:26,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:40:26,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:40:26,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:40:26,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:40:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:40:27,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:40:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:40:27,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:40:27,455 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:40:27,456 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:40:27,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:40:27,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:40:27,661 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 02:40:27,821 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:40:27,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:40:27 BoogieIcfgContainer [2024-10-13 02:40:27,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:40:27,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:40:27,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:40:27,835 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:40:27,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:40:21" (3/4) ... [2024-10-13 02:40:27,838 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:40:27,841 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:40:27,843 INFO L158 Benchmark]: Toolchain (without parser) took 7649.61ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 120.7MB in the beginning and 176.6MB in the end (delta: -56.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:40:27,843 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:40:27,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.05ms. Allocated memory is still 172.0MB. Free memory was 120.7MB in the beginning and 101.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 02:40:27,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.36ms. Allocated memory is still 172.0MB. Free memory was 101.8MB in the beginning and 97.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:40:27,844 INFO L158 Benchmark]: Boogie Preprocessor took 99.36ms. Allocated memory is still 172.0MB. Free memory was 97.6MB in the beginning and 91.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:40:27,845 INFO L158 Benchmark]: RCFGBuilder took 730.08ms. Allocated memory is still 172.0MB. Free memory was 91.4MB in the beginning and 59.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 02:40:27,846 INFO L158 Benchmark]: TraceAbstraction took 6324.08ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 59.2MB in the beginning and 177.7MB in the end (delta: -118.4MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2024-10-13 02:40:27,846 INFO L158 Benchmark]: Witness Printer took 5.89ms. Allocated memory is still 222.3MB. Free memory was 177.7MB in the beginning and 176.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:40:27,847 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.05ms. Allocated memory is still 172.0MB. Free memory was 120.7MB in the beginning and 101.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.36ms. Allocated memory is still 172.0MB. Free memory was 101.8MB in the beginning and 97.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.36ms. Allocated memory is still 172.0MB. Free memory was 97.6MB in the beginning and 91.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 730.08ms. Allocated memory is still 172.0MB. Free memory was 91.4MB in the beginning and 59.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6324.08ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 59.2MB in the beginning and 177.7MB in the end (delta: -118.4MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Witness Printer took 5.89ms. Allocated memory is still 222.3MB. Free memory was 177.7MB in the beginning and 176.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 205. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_4 = -64; [L24] signed char var_1_9 = 10; [L25] unsigned char var_1_10 = 0; [L26] signed char var_1_11 = -1; [L27] unsigned short int var_1_12 = 10000; [L28] float var_1_13 = 5.4; [L29] float var_1_14 = 1.4; [L30] unsigned short int var_1_18 = 32; [L31] double var_1_20 = 1.5; [L32] double var_1_21 = 2.75; [L33] unsigned char var_1_22 = 5; [L34] unsigned short int var_1_23 = 55712; [L35] unsigned char var_1_24 = 5; [L36] signed short int var_1_25 = 10; [L37] float var_1_26 = 64.2; [L38] unsigned short int var_1_27 = 64; [L39] float var_1_33 = 2.5; [L40] unsigned long int var_1_35 = 10; [L41] unsigned long int var_1_37 = 2924974040; [L42] unsigned char var_1_38 = 1; [L43] unsigned char var_1_39 = 0; [L44] unsigned char var_1_40 = 0; [L45] unsigned char var_1_41 = 0; [L46] unsigned char var_1_44 = 0; [L47] unsigned char var_1_45 = 0; [L48] unsigned long int var_1_46 = 32; [L49] unsigned long int var_1_47 = 1000000000; [L50] unsigned long int last_1_var_1_1 = 16; [L51] signed char last_1_var_1_9 = 10; [L52] unsigned short int last_1_var_1_12 = 10000; [L53] double last_1_var_1_20 = 1.5; [L54] unsigned char last_1_var_1_22 = 5; [L55] signed short int last_1_var_1_25 = 10; [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L197] last_1_var_1_1 = var_1_1 [L198] last_1_var_1_9 = var_1_9 [L199] last_1_var_1_12 = var_1_12 [L200] last_1_var_1_20 = var_1_20 [L201] last_1_var_1_22 = var_1_22 [L202] last_1_var_1_25 = var_1_25 [L212] RET updateLastVariables() [L213] CALL updateVariables() [L152] var_1_4 = __VERIFIER_nondet_long() [L153] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L153] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L154] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L154] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L155] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L156] var_1_10 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L157] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L158] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L159] var_1_11 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L160] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L161] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L162] var_1_13 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L163] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L164] var_1_14 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L165] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L166] var_1_18 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L168] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L168] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L169] var_1_21 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L170] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L171] var_1_23 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L172] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L173] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L173] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L174] var_1_24 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L175] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L176] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L176] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L177] var_1_26 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L178] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L179] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L179] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L180] var_1_37 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_37 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L181] RET assume_abort_if_not(var_1_37 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L182] CALL assume_abort_if_not(var_1_37 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L182] RET assume_abort_if_not(var_1_37 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L183] var_1_39 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L184] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L185] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L185] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L186] var_1_40 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L187] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L188] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L188] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L189] var_1_44 = __VERIFIER_nondet_uchar() [L190] CALL assume_abort_if_not(var_1_44 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L190] RET assume_abort_if_not(var_1_44 >= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L191] CALL assume_abort_if_not(var_1_44 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L191] RET assume_abort_if_not(var_1_44 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L192] var_1_45 = __VERIFIER_nondet_uchar() [L193] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L193] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L194] CALL assume_abort_if_not(var_1_45 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L194] RET assume_abort_if_not(var_1_45 <= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L213] RET updateVariables() [L214] CALL step() [L59] COND FALSE !(var_1_25 < (var_1_18 - ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L64] COND FALSE !(var_1_25 < var_1_25) [L67] var_1_33 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L69] COND TRUE \read(var_1_10) [L70] var_1_35 = ((((var_1_22) > (var_1_25)) ? (var_1_22) : (var_1_25))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L78] COND TRUE var_1_13 >= (- 255.45f) [L79] var_1_38 = ((! var_1_39) && var_1_40) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L85] COND TRUE ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) < (var_1_12 % var_1_4) [L86] var_1_41 = ((! (var_1_40 && var_1_44)) || (var_1_39 && var_1_45)) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L90] COND TRUE \read(var_1_10) [L91] var_1_46 = (var_1_23 + ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L95] COND TRUE \read(var_1_44) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=1000000000, var_1_4=15, var_1_9=10] [L96] COND FALSE !(\read(var_1_45)) [L101] var_1_47 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=10] [L104] COND FALSE !(! var_1_10) [L111] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L113] unsigned char stepLocal_2 = var_1_10; [L114] signed long int stepLocal_1 = last_1_var_1_22; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, stepLocal_2=1, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L115] COND TRUE ((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || stepLocal_2 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, var_1_10=1, var_1_11=57, var_1_12=10000, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L116] COND FALSE !(stepLocal_1 >= last_1_var_1_12) [L119] var_1_12 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L122] unsigned long int stepLocal_5 = last_1_var_1_1; [L123] signed long int stepLocal_4 = var_1_4 + last_1_var_1_9; [L124] unsigned short int stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=65537, stepLocal_4=25, stepLocal_5=16, var_1_10=1, var_1_11=57, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=5, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L125] COND FALSE !(stepLocal_5 > last_1_var_1_12) [L136] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=65537, stepLocal_4=25, var_1_10=1, var_1_11=57, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=-252, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L138] COND TRUE var_1_11 > (var_1_22 * (var_1_12 + var_1_22)) [L139] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=65537, stepLocal_4=25, var_1_10=1, var_1_11=57, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=-32768, var_1_24=-252, var_1_25=10, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L141] COND TRUE (var_1_20 / var_1_26) > var_1_13 [L142] var_1_25 = ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=65537, stepLocal_4=25, var_1_10=1, var_1_11=57, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=-32768, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L146] signed long int stepLocal_0 = (var_1_25 + var_1_9) / var_1_4; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_0=4, stepLocal_3=65537, stepLocal_4=25, var_1_10=1, var_1_11=57, var_1_12=5, var_1_18=65537, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=-32768, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L147] COND TRUE stepLocal_0 == var_1_25 [L148] var_1_1 = (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=65537, stepLocal_4=25, var_1_10=1, var_1_11=57, var_1_12=5, var_1_18=65537, var_1_1=8, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=-32768, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L214] RET step() [L215] CALL, EXPR property() [L205-L206] return ((((((((var_1_25 + var_1_9) / var_1_4) == var_1_25) ? (var_1_1 == ((unsigned long int) (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22))) : 1) && ((! var_1_10) ? ((((((last_1_var_1_22) > (last_1_var_1_25)) ? (last_1_var_1_22) : (last_1_var_1_25))) >= last_1_var_1_12) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10) ? ((last_1_var_1_22 >= last_1_var_1_12) ? (var_1_12 == ((unsigned short int) (((((last_1_var_1_22) < (last_1_var_1_22)) ? (last_1_var_1_22) : (last_1_var_1_22))) + 32))) : (var_1_12 == ((unsigned short int) last_1_var_1_22))) : 1)) && ((var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((last_1_var_1_1 > last_1_var_1_12) ? ((last_1_var_1_1 >= (var_1_4 + last_1_var_1_9)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_20 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=5, var_1_18=65537, var_1_1=8, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=-32768, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=57, var_1_12=5, var_1_18=65537, var_1_1=8, var_1_20=2, var_1_21=2, var_1_22=-252, var_1_23=-32768, var_1_24=-252, var_1_25=4, var_1_27=64, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32773, var_1_47=4, var_1_4=15, var_1_9=57] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 5, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 396 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 1116 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 598 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 434 IncrementalHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 518 mSDtfsCounter, 434 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 600 GetRequests, 583 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=4, InterpolantAutomatonStates: 20, 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, 38 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1239 NumberOfCodeBlocks, 1239 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1054 ConstructedInterpolants, 0 QuantifiedInterpolants, 1769 SizeOfPredicates, 0 NumberOfNonLiveVariables, 429 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 9045/9072 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-13 02:40:27,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da4df5dd1fae50c8c45db2adce0db91c4abebe1be827a98b4c34c4c101f7143b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:40:30,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:40:30,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:40:30,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:40:30,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:40:30,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:40:30,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:40:30,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:40:30,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:40:30,260 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:40:30,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:40:30,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:40:30,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:40:30,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:40:30,264 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:40:30,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:40:30,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:40:30,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:40:30,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:40:30,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:40:30,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:40:30,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:40:30,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:40:30,271 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:40:30,271 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:40:30,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:40:30,271 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:40:30,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:40:30,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:40:30,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:40:30,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:40:30,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:40:30,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:40:30,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:40:30,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:40:30,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:40:30,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:40:30,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:40:30,277 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:40:30,278 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:40:30,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:40:30,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:40:30,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:40:30,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:40:30,279 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:40:30,279 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da4df5dd1fae50c8c45db2adce0db91c4abebe1be827a98b4c34c4c101f7143b [2024-10-13 02:40:30,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:40:30,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:40:30,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:40:30,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:40:30,665 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:40:30,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-10-13 02:40:32,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:40:32,549 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:40:32,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-10-13 02:40:32,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52209e4ca/49db4f1058e24b7ba9ca9cb33ca61368/FLAG54e10307a [2024-10-13 02:40:32,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52209e4ca/49db4f1058e24b7ba9ca9cb33ca61368 [2024-10-13 02:40:32,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:40:32,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:40:32,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:40:32,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:40:32,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:40:32,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:40:32" (1/1) ... [2024-10-13 02:40:32,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f947f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:32, skipping insertion in model container [2024-10-13 02:40:32,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:40:32" (1/1) ... [2024-10-13 02:40:32,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:40:32,838 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_fillercode_fillercodestructure_filler-ps-ci_file-26.i[919,932] [2024-10-13 02:40:32,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:40:32,962 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:40:32,978 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_fillercode_fillercodestructure_filler-ps-ci_file-26.i[919,932] [2024-10-13 02:40:33,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:40:33,049 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:40:33,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33 WrapperNode [2024-10-13 02:40:33,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:40:33,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:40:33,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:40:33,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:40:33,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,118 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-10-13 02:40:33,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:40:33,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:40:33,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:40:33,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:40:33,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,174 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-13 02:40:33,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:40:33,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:40:33,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:40:33,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:40:33,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (1/1) ... [2024-10-13 02:40:33,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:40:33,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:40:33,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:40:33,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:40:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:40:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:40:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:40:33,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:40:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:40:33,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:40:33,381 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:40:33,384 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:40:46,809 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 02:40:46,810 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:40:46,904 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:40:46,906 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:40:46,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:40:46 BoogieIcfgContainer [2024-10-13 02:40:46,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:40:46,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:40:46,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:40:46,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:40:46,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:40:32" (1/3) ... [2024-10-13 02:40:46,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209e668a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:40:46, skipping insertion in model container [2024-10-13 02:40:46,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:40:33" (2/3) ... [2024-10-13 02:40:46,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209e668a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:40:46, skipping insertion in model container [2024-10-13 02:40:46,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:40:46" (3/3) ... [2024-10-13 02:40:46,919 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-26.i [2024-10-13 02:40:46,938 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:40:46,939 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:40:47,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:40:47,030 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;@74218876, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:40:47,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:40:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:40:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-13 02:40:47,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:40:47,057 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:40:47,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:40:47,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:40:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash -964171668, now seen corresponding path program 1 times [2024-10-13 02:40:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:40:47,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271653215] [2024-10-13 02:40:47,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:47,084 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-13 02:40:47,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:40:47,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:40:47,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:40:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:48,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:40:48,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:40:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:40:48,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:40:48,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:40:48,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271653215] [2024-10-13 02:40:48,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271653215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:40:48,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:40:48,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:40:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922392019] [2024-10-13 02:40:48,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:40:48,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:40:48,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:40:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:40:48,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:40:48,297 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:40:52,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:40:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:40:52,695 INFO L93 Difference]: Finished difference Result 161 states and 296 transitions. [2024-10-13 02:40:52,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:40:52,804 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), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-13 02:40:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:40:52,812 INFO L225 Difference]: With dead ends: 161 [2024-10-13 02:40:52,813 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 02:40:52,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 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-13 02:40:52,819 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:40:52,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 02:40:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 02:40:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 02:40:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:40:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2024-10-13 02:40:52,872 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 176 [2024-10-13 02:40:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:40:52,877 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2024-10-13 02:40:52,877 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), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:40:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2024-10-13 02:40:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-13 02:40:52,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:40:52,882 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:40:52,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:40:53,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:40:53,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:40:53,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:40:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1336650922, now seen corresponding path program 1 times [2024-10-13 02:40:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:40:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040059938] [2024-10-13 02:40:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:40:53,086 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-13 02:40:53,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:40:53,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:40:53,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:40:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:40:54,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:40:54,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:40:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 363 proven. 9 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2024-10-13 02:40:55,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:40:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 02:40:57,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:40:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040059938] [2024-10-13 02:40:57,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040059938] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:40:57,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:40:57,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-13 02:40:57,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121270518] [2024-10-13 02:40:57,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:40:57,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:40:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:40:57,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:40:57,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:40:57,594 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:41:04,859 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-13 02:41:08,875 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-13 02:41:10,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:41:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:12,209 INFO L93 Difference]: Finished difference Result 205 states and 324 transitions. [2024-10-13 02:41:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:41:12,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 176 [2024-10-13 02:41:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:12,214 INFO L225 Difference]: With dead ends: 205 [2024-10-13 02:41:12,218 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 02:41:12,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:41:12,223 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 84 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:12,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 315 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 309 Invalid, 2 Unknown, 0 Unchecked, 14.2s Time] [2024-10-13 02:41:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 02:41:12,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2024-10-13 02:41:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 67 states have internal predecessors, (87), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 02:41:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 191 transitions. [2024-10-13 02:41:12,271 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 191 transitions. Word has length 176 [2024-10-13 02:41:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:12,271 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 191 transitions. [2024-10-13 02:41:12,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 02:41:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 191 transitions. [2024-10-13 02:41:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-13 02:41:12,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:12,277 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:41:12,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 02:41:12,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:41:12,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:12,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash 932629815, now seen corresponding path program 1 times [2024-10-13 02:41:12,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:41:12,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378090802] [2024-10-13 02:41:12,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:12,480 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-13 02:41:12,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:41:12,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:41:12,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:41:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:13,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:41:13,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:41:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-10-13 02:41:17,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:41:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:41:19,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:41:19,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378090802] [2024-10-13 02:41:19,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378090802] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 02:41:19,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 02:41:19,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-13 02:41:19,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121710928] [2024-10-13 02:41:19,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:41:19,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:41:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:41:19,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:41:19,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:41:19,654 INFO L87 Difference]: Start difference. First operand 121 states and 191 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:25,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:41:29,019 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-13 02:41:33,029 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-13 02:41:37,041 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-13 02:41:41,055 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-13 02:41:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:41,216 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2024-10-13 02:41:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:41:41,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-13 02:41:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:41,221 INFO L225 Difference]: With dead ends: 239 [2024-10-13 02:41:41,221 INFO L226 Difference]: Without dead ends: 156 [2024-10-13 02:41:41,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:41:41,223 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 46 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:41,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 365 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 21.4s Time] [2024-10-13 02:41:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-13 02:41:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2024-10-13 02:41:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 94 states have (on average 1.351063829787234) internal successors, (127), 96 states have internal predecessors, (127), 55 states have call successors, (55), 3 states have call predecessors, (55), 3 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-13 02:41:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 237 transitions. [2024-10-13 02:41:41,249 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 237 transitions. Word has length 177 [2024-10-13 02:41:41,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:41,250 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 237 transitions. [2024-10-13 02:41:41,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 237 transitions. [2024-10-13 02:41:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 02:41:41,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:41,253 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:41:41,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 02:41:41,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:41:41,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:41,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1451207695, now seen corresponding path program 1 times [2024-10-13 02:41:41,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:41:41,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035924139] [2024-10-13 02:41:41,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:41,456 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-13 02:41:41,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:41:41,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:41:41,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 02:41:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:42,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:41:42,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:41:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:41:46,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:41:46,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:41:46,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035924139] [2024-10-13 02:41:46,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035924139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:41:46,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:41:46,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:41:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030958085] [2024-10-13 02:41:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:41:46,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:41:46,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:41:46,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:41:46,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:41:46,838 INFO L87 Difference]: Start difference. First operand 153 states and 237 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)