./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-co_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7327b2df7c4359abf51049746e044c1d2b1b08c2a17a4cad44bc7507fef78cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:20:16,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:20:16,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:20:16,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:20:16,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:20:16,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:20:16,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:20:16,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:20:16,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:20:16,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:20:16,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:20:16,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:20:16,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:20:16,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:20:16,126 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:20:16,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:20:16,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:20:16,127 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:20:16,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:20:16,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:20:16,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:20:16,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:20:16,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:20:16,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:20:16,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:20:16,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:20:16,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:20:16,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:20:16,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:20:16,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:20:16,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:20:16,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:20:16,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:20:16,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:20:16,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:20:16,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:20:16,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:20:16,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:20:16,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:20:16,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:20:16,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:20:16,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:20:16,141 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7327b2df7c4359abf51049746e044c1d2b1b08c2a17a4cad44bc7507fef78cc [2024-10-11 10:20:16,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:20:16,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:20:16,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:20:16,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:20:16,398 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:20:16,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i [2024-10-11 10:20:17,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:20:17,782 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:20:17,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i [2024-10-11 10:20:17,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/25ae702db/f8f6cc784be24000bb41e45d0fb7a8cc/FLAGfbf322a45 [2024-10-11 10:20:17,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/25ae702db/f8f6cc784be24000bb41e45d0fb7a8cc [2024-10-11 10:20:17,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:20:17,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:20:17,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:20:17,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:20:17,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:20:17,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:20:17" (1/1) ... [2024-10-11 10:20:17,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f605b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:17, skipping insertion in model container [2024-10-11 10:20:17,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:20:17" (1/1) ... [2024-10-11 10:20:17,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:20:18,002 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-co_file-18.i[919,932] [2024-10-11 10:20:18,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:20:18,081 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:20:18,090 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-co_file-18.i[919,932] [2024-10-11 10:20:18,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:20:18,145 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:20:18,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18 WrapperNode [2024-10-11 10:20:18,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:20:18,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:20:18,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:20:18,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:20:18,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,193 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-11 10:20:18,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:20:18,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:20:18,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:20:18,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:20:18,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,218 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:20:18,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:20:18,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:20:18,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:20:18,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:20:18,232 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (1/1) ... [2024-10-11 10:20:18,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:20:18,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:20:18,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:20:18,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:20:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:20:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:20:18,303 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:20:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:20:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:20:18,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:20:18,409 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:20:18,412 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:20:18,676 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 10:20:18,676 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:20:18,715 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:20:18,715 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:20:18,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:20:18 BoogieIcfgContainer [2024-10-11 10:20:18,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:20:18,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:20:18,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:20:18,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:20:18,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:20:17" (1/3) ... [2024-10-11 10:20:18,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f20bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:20:18, skipping insertion in model container [2024-10-11 10:20:18,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:18" (2/3) ... [2024-10-11 10:20:18,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f20bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:20:18, skipping insertion in model container [2024-10-11 10:20:18,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:20:18" (3/3) ... [2024-10-11 10:20:18,723 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i [2024-10-11 10:20:18,736 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:20:18,737 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:20:18,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:20:18,788 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;@29865cd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:20:18,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:20:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:20:18,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 10:20:18,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:20:18,804 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:20:18,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:20:18,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:20:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 236421281, now seen corresponding path program 1 times [2024-10-11 10:20:18,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:20:18,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443737705] [2024-10-11 10:20:18,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:20:18,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:20:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:20:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:20:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:20:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:20:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:20:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:20:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:20:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:20:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:20:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:20:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:20:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:20:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:20:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:20:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:20:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:20:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:20:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:20:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:20:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:20:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:20:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:20:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:20:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:20:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:20:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:20:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:20:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:20:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:20:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:20:19,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:20:19,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443737705] [2024-10-11 10:20:19,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443737705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:20:19,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:20:19,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:20:19,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360450311] [2024-10-11 10:20:19,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:20:19,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:20:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:20:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:20:19,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:20:19,240 INFO L87 Difference]: Start difference. First operand has 90 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 10:20:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:20:19,287 INFO L93 Difference]: Finished difference Result 177 states and 319 transitions. [2024-10-11 10:20:19,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:20:19,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 185 [2024-10-11 10:20:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:20:19,300 INFO L225 Difference]: With dead ends: 177 [2024-10-11 10:20:19,300 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 10:20:19,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:20:19,308 INFO L432 NwaCegarLoop]: 138 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, 138 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-11 10:20:19,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:20:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 10:20:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 10:20:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.456140350877193) internal successors, (83), 57 states have internal predecessors, (83), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:20:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 141 transitions. [2024-10-11 10:20:19,350 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 141 transitions. Word has length 185 [2024-10-11 10:20:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:20:19,350 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 141 transitions. [2024-10-11 10:20:19,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 10:20:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 141 transitions. [2024-10-11 10:20:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 10:20:19,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:20:19,354 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:20:19,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:20:19,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:20:19,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:20:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1513432023, now seen corresponding path program 1 times [2024-10-11 10:20:19,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:20:19,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664262563] [2024-10-11 10:20:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:20:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:20:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:20:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:20:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:20:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:20:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:20:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:20:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:20:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:20:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:20:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:20:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:20:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:20:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:20:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:20:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:20:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:20:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:20:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:20:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:20:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:20:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:20:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:20:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:20:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:20:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:20:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:20:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:20:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:20:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:20:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:20:19,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:20:19,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664262563] [2024-10-11 10:20:19,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664262563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:20:19,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:20:19,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:20:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012412659] [2024-10-11 10:20:19,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:20:19,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:20:19,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:20:19,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:20:19,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:20:19,798 INFO L87 Difference]: Start difference. First operand 88 states and 141 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:20:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:20:19,857 INFO L93 Difference]: Finished difference Result 257 states and 416 transitions. [2024-10-11 10:20:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:20:19,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2024-10-11 10:20:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:20:19,860 INFO L225 Difference]: With dead ends: 257 [2024-10-11 10:20:19,860 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 10:20:19,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:20:19,866 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 81 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:20:19,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 265 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:20:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 10:20:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 143. [2024-10-11 10:20:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 10:20:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 226 transitions. [2024-10-11 10:20:19,887 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 226 transitions. Word has length 185 [2024-10-11 10:20:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:20:19,888 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 226 transitions. [2024-10-11 10:20:19,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:20:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 226 transitions. [2024-10-11 10:20:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 10:20:19,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:20:19,891 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:20:19,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:20:19,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:20:19,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:20:19,892 INFO L85 PathProgramCache]: Analyzing trace with hash -884847792, now seen corresponding path program 1 times [2024-10-11 10:20:19,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:20:19,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736184924] [2024-10-11 10:20:19,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:20:19,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:20:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:20:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:20:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:20:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:20:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:20:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:20:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:20:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:20:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:20:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:20:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:20:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:20:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:20:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:20:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:20:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:20:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:20:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:20:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:20:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:20:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:20:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:20:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:20:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:20:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:20:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:20:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:20:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:20:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:20:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:20:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:20:20,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736184924] [2024-10-11 10:20:20,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736184924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:20:20,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:20:20,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:20:20,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471483101] [2024-10-11 10:20:20,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:20:20,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:20:20,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:20:20,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:20:20,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:20:20,097 INFO L87 Difference]: Start difference. First operand 143 states and 226 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:20:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:20:20,162 INFO L93 Difference]: Finished difference Result 253 states and 408 transitions. [2024-10-11 10:20:20,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:20:20,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 186 [2024-10-11 10:20:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:20:20,165 INFO L225 Difference]: With dead ends: 253 [2024-10-11 10:20:20,165 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 10:20:20,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:20:20,167 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 72 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:20:20,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 255 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:20:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 10:20:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 145. [2024-10-11 10:20:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 10:20:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 229 transitions. [2024-10-11 10:20:20,203 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 229 transitions. Word has length 186 [2024-10-11 10:20:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:20:20,205 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 229 transitions. [2024-10-11 10:20:20,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:20:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 229 transitions. [2024-10-11 10:20:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 10:20:20,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:20:20,207 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:20:20,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:20:20,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:20:20,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:20:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1910854392, now seen corresponding path program 1 times [2024-10-11 10:20:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:20:20,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488966117] [2024-10-11 10:20:20,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:20:20,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:20:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:20:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:20:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:20:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:20:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:20:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:20:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:20:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:20:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:20:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:20:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:20:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:20:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:20:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:20:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:20:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:20:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:20:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:20:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:20:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:20:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:20:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:20:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:20:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:20:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:20:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:20:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:20:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:20:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:20:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:20:20,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:20:20,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488966117] [2024-10-11 10:20:20,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488966117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:20:20,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:20:20,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:20:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706138037] [2024-10-11 10:20:20,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:20:20,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:20:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:20:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:20:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:20:20,425 INFO L87 Difference]: Start difference. First operand 145 states and 229 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:20:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:20:20,472 INFO L93 Difference]: Finished difference Result 247 states and 396 transitions. [2024-10-11 10:20:20,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:20:20,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-11 10:20:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:20:20,475 INFO L225 Difference]: With dead ends: 247 [2024-10-11 10:20:20,475 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 10:20:20,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:20:20,476 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 55 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:20:20,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 251 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:20:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 10:20:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2024-10-11 10:20:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 10:20:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 246 transitions. [2024-10-11 10:20:20,494 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 246 transitions. Word has length 188 [2024-10-11 10:20:20,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:20:20,495 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 246 transitions. [2024-10-11 10:20:20,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:20:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 246 transitions. [2024-10-11 10:20:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 10:20:20,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:20:20,501 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:20:20,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:20:20,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:20:20,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:20:20,502 INFO L85 PathProgramCache]: Analyzing trace with hash 899737142, now seen corresponding path program 1 times [2024-10-11 10:20:20,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:20:20,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999190736] [2024-10-11 10:20:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:20:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:20:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:20:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:20:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:20:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:20:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:20:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:20:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:20:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:20:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:20:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:20:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:20:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:20:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:20:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:20:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:20:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:20:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:20:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:20:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:20:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:20:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:20:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:20:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:20:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:20:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:20:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:20:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:20:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:20:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:20:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:20:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:20:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999190736] [2024-10-11 10:20:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999190736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:20:20,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:20:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:20:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785775045] [2024-10-11 10:20:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:20:20,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:20:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:20:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:20:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:20:20,736 INFO L87 Difference]: Start difference. First operand 155 states and 246 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:20:20,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:20:20,827 INFO L93 Difference]: Finished difference Result 248 states and 396 transitions. [2024-10-11 10:20:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:20:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-11 10:20:20,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:20:20,829 INFO L225 Difference]: With dead ends: 248 [2024-10-11 10:20:20,829 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 10:20:20,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-11 10:20:20,830 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 89 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:20:20,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 248 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:20:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 10:20:20,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2024-10-11 10:20:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 10:20:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 245 transitions. [2024-10-11 10:20:20,854 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 245 transitions. Word has length 188 [2024-10-11 10:20:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:20:20,854 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 245 transitions. [2024-10-11 10:20:20,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:20:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 245 transitions. [2024-10-11 10:20:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 10:20:20,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:20:20,856 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:20:20,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:20:20,857 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:20:20,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:20:20,858 INFO L85 PathProgramCache]: Analyzing trace with hash -380126536, now seen corresponding path program 1 times [2024-10-11 10:20:20,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:20:20,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693383075] [2024-10-11 10:20:20,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:20:20,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:20:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:20:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:20:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:20:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:20:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:20:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:20:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:20:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:20:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:20:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:20:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:20:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:20:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:20:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:20:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:20:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:20:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:20:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:20:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:20:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:20:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:20:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:20:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:20:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:20:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:20:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:20:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:20:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:20:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:20:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:20:21,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:20:21,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693383075] [2024-10-11 10:20:21,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693383075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:20:21,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:20:21,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:20:21,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642892097] [2024-10-11 10:20:21,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:20:21,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:20:21,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:20:21,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:20:21,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:20:21,142 INFO L87 Difference]: Start difference. First operand 155 states and 245 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 10:20:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:20:21,373 INFO L93 Difference]: Finished difference Result 283 states and 450 transitions. [2024-10-11 10:20:21,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:20:21,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-10-11 10:20:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:20:21,375 INFO L225 Difference]: With dead ends: 283 [2024-10-11 10:20:21,375 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 10:20:21,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:20:21,376 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 211 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:20:21,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 392 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:20:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 10:20:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 166. [2024-10-11 10:20:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 58 states have call successors, (58), 3 states have call predecessors, (58), 3 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 10:20:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 258 transitions. [2024-10-11 10:20:21,392 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 258 transitions. Word has length 188 [2024-10-11 10:20:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:20:21,393 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 258 transitions. [2024-10-11 10:20:21,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 10:20:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 258 transitions. [2024-10-11 10:20:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 10:20:21,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:20:21,395 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:20:21,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:20:21,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:20:21,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:20:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1920696054, now seen corresponding path program 1 times [2024-10-11 10:20:21,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:20:21,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726822826] [2024-10-11 10:20:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:20:21,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:20:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:20:21,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256506309] [2024-10-11 10:20:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:20:21,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:20:21,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:20:21,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:20:21,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:20:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:20:21,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:20:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:20:21,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:20:21,752 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:20:21,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:20:21,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:20:21,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:20:21,958 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:20:22,060 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:20:22,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:20:22 BoogieIcfgContainer [2024-10-11 10:20:22,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:20:22,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:20:22,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:20:22,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:20:22,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:20:18" (3/4) ... [2024-10-11 10:20:22,068 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:20:22,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:20:22,069 INFO L158 Benchmark]: Toolchain (without parser) took 4248.46ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 99.3MB in the beginning and 77.4MB in the end (delta: 21.9MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2024-10-11 10:20:22,069 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:20:22,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.54ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 144.5MB in the end (delta: -45.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-10-11 10:20:22,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.51ms. Allocated memory is still 176.2MB. Free memory was 144.5MB in the beginning and 144.8MB in the end (delta: -314.7kB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-10-11 10:20:22,069 INFO L158 Benchmark]: Boogie Preprocessor took 34.01ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 140.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:20:22,070 INFO L158 Benchmark]: RCFGBuilder took 483.63ms. Allocated memory is still 176.2MB. Free memory was 140.6MB in the beginning and 121.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 10:20:22,070 INFO L158 Benchmark]: TraceAbstraction took 3348.33ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 121.3MB in the beginning and 77.4MB in the end (delta: 43.9MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2024-10-11 10:20:22,070 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 218.1MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:20:22,071 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.14ms. Allocated memory is still 176.2MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.54ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 144.5MB in the end (delta: -45.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.51ms. Allocated memory is still 176.2MB. Free memory was 144.5MB in the beginning and 144.8MB in the end (delta: -314.7kB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.01ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 140.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 483.63ms. Allocated memory is still 176.2MB. Free memory was 140.6MB in the beginning and 121.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3348.33ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 121.3MB in the beginning and 77.4MB in the end (delta: 43.9MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 218.1MB. Free memory is still 77.4MB. 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 195, overapproximation of someBinaryArithmeticDOUBLEoperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 195, overapproximation of someBinaryArithmeticFLOAToperation at line 113. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -1; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 5.5; [L25] float var_1_5 = 255.475; [L26] unsigned char var_1_7 = 0; [L27] signed char var_1_8 = -5; [L28] signed char var_1_9 = 2; [L29] unsigned char var_1_10 = 16; [L30] unsigned char var_1_11 = 16; [L31] float var_1_12 = 10000000.8; [L32] float var_1_13 = 127.7; [L33] float var_1_14 = 199.2; [L34] float var_1_15 = 999999.5; [L35] signed long int var_1_16 = -8; [L36] signed short int var_1_18 = -8; [L37] double var_1_19 = 5.4; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; [L40] signed char var_1_22 = 1; [L41] signed short int var_1_25 = 32; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 0; [L44] unsigned long int var_1_29 = 5; [L45] unsigned long int var_1_30 = 4; [L46] unsigned char var_1_31 = 2; [L47] unsigned char var_1_34 = 5; [L48] unsigned char var_1_35 = 25; [L49] unsigned char var_1_36 = 10; [L50] unsigned short int var_1_37 = 64; [L51] unsigned short int var_1_38 = 16; [L52] signed long int var_1_39 = -50; [L53] signed char last_1_var_1_1 = -1; [L54] unsigned char last_1_var_1_10 = 16; [L55] signed long int last_1_var_1_16 = -8; [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L190] last_1_var_1_1 = var_1_1 [L191] last_1_var_1_10 = var_1_10 [L192] last_1_var_1_16 = var_1_16 [L202] RET updateLastVariables() [L203] CALL updateVariables() [L142] var_1_3 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L143] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L144] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L145] var_1_4 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L146] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L147] var_1_5 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L148] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L152] var_1_8 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=2] [L153] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=2] [L154] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=2] [L154] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=2] [L155] var_1_9 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L156] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L157] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L157] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L158] var_1_11 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L159] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L160] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L160] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L161] var_1_13 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L162] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L163] var_1_14 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L164] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L165] var_1_15 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L166] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L167] var_1_21 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L168] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L169] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L169] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L170] var_1_25 = __VERIFIER_nondet_short() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L172] CALL assume_abort_if_not(var_1_25 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L172] RET assume_abort_if_not(var_1_25 <= 32) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L173] var_1_28 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L174] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L175] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L175] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L176] var_1_30 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L177] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L178] CALL assume_abort_if_not(var_1_30 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L178] RET assume_abort_if_not(var_1_30 <= 8) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L179] var_1_34 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L180] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L181] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L181] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L182] var_1_35 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L183] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L184] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L184] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L185] var_1_36 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L186] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L187] CALL assume_abort_if_not(var_1_36 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L187] RET assume_abort_if_not(var_1_36 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L203] RET updateVariables() [L204] CALL step() [L59] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L60] EXPR var_1_16 >> var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L60] COND TRUE var_1_1 > ((var_1_16 >> var_1_25) * var_1_10) [L61] var_1_22 = var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L63] COND TRUE (-128 >> 10u) >= var_1_18 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L64] COND TRUE var_1_18 >= (var_1_18 + var_1_25) [L65] var_1_27 = (var_1_21 || var_1_28) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L68] COND TRUE 64 >= (10 * var_1_1) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L69] EXPR var_1_1 >> var_1_30 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L69] COND FALSE !(var_1_25 <= (var_1_1 >> var_1_30)) [L72] var_1_29 = var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L75] EXPR var_1_30 & var_1_10 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L75] COND FALSE !(var_1_1 < (var_1_30 & var_1_10)) [L80] COND FALSE !(var_1_16 >= var_1_10) [L83] var_1_37 = ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L85] COND FALSE !(var_1_18 < var_1_16) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=0, var_1_9=-1] [L88] COND TRUE 100.75 >= ((((var_1_12 + var_1_19) < 0 ) ? -(var_1_12 + var_1_19) : (var_1_12 + var_1_19))) [L89] var_1_39 = ((((var_1_16) < (var_1_34)) ? (var_1_16) : (var_1_34))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L91] signed long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_0=-8, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L92] COND FALSE !(var_1_9 < stepLocal_0) [L97] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L99] COND TRUE \read(var_1_7) [L100] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=0, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L104] signed long int stepLocal_2 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=0, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L105] COND TRUE ! (last_1_var_1_1 > last_1_var_1_10) [L106] var_1_19 = ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_13=2, var_1_14=0, var_1_16=0, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L112] COND TRUE var_1_5 <= (var_1_19 / var_1_3) [L113] var_1_12 = ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=0, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L117] COND FALSE !((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) [L124] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=0, var_1_18=-8, var_1_19=2, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L126] signed char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_1=0, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=0, var_1_18=-8, var_1_19=2, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L127] COND FALSE !(stepLocal_1 >= (var_1_16 + var_1_10)) [L138] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=0, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L204] RET step() [L205] CALL, EXPR property() [L195-L196] return (((((((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) ? (var_1_7 ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_9))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_9 < last_1_var_1_16) ? (((var_1_4 - var_1_5) > var_1_3) ? (var_1_10 == ((unsigned char) 8)) : 1) : (var_1_10 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_19 / var_1_3)) ? (var_1_12 == ((float) ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) : (var_1_12 == ((float) var_1_14)))) && (var_1_7 ? (var_1_16 == ((signed long int) var_1_8)) : (var_1_16 == ((signed long int) (var_1_11 - ((((var_1_10 - var_1_10) < 0 ) ? -(var_1_10 - var_1_10) : (var_1_10 - var_1_10)))))))) && ((var_1_1 >= (var_1_16 + var_1_10)) ? ((var_1_5 < 999.5f) ? (var_1_7 ? (var_1_18 == ((signed short int) (var_1_16 + var_1_16))) : (var_1_18 == ((signed short int) var_1_8))) : (var_1_18 == ((signed short int) var_1_9))) : (var_1_18 == ((signed short int) var_1_8)))) && ((! (last_1_var_1_1 > last_1_var_1_10)) ? (var_1_19 == ((double) ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))))) : ((last_1_var_1_10 > var_1_9) ? (var_1_19 == ((double) var_1_15)) : 1)) ; [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=0, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=0, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-8, var_1_7=1, var_1_8=0, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 508 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 508 mSDsluCounter, 1549 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 764 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 785 mSDtfsCounter, 277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=6, 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 81 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1496 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1114 ConstructedInterpolants, 0 QuantifiedInterpolants, 2472 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 9744/9744 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:20:22,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7327b2df7c4359abf51049746e044c1d2b1b08c2a17a4cad44bc7507fef78cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:20:23,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:20:23,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:20:23,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:20:23,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:20:23,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:20:23,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:20:23,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:20:23,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:20:23,994 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:20:23,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:20:23,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:20:23,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:20:23,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:20:23,996 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:20:23,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:20:23,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:20:23,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:20:23,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:20:23,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:20:23,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:20:24,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:20:24,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:20:24,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:20:24,003 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:20:24,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:20:24,003 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:20:24,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:20:24,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:20:24,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:20:24,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:20:24,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:20:24,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:20:24,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:20:24,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:20:24,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:20:24,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:20:24,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:20:24,005 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:20:24,006 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:20:24,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:20:24,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:20:24,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:20:24,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:20:24,007 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:20:24,008 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7327b2df7c4359abf51049746e044c1d2b1b08c2a17a4cad44bc7507fef78cc [2024-10-11 10:20:24,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:20:24,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:20:24,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:20:24,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:20:24,305 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:20:24,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i [2024-10-11 10:20:25,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:20:25,786 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:20:25,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i [2024-10-11 10:20:25,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d2108a1f0/65f84fa49c6e45a1aefbba08a1c927d6/FLAGb57306abf [2024-10-11 10:20:25,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d2108a1f0/65f84fa49c6e45a1aefbba08a1c927d6 [2024-10-11 10:20:25,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:20:25,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:20:25,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:20:25,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:20:25,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:20:25,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:20:25" (1/1) ... [2024-10-11 10:20:25,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6aaab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:25, skipping insertion in model container [2024-10-11 10:20:25,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:20:25" (1/1) ... [2024-10-11 10:20:25,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:20:26,003 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-co_file-18.i[919,932] [2024-10-11 10:20:26,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:20:26,096 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:20:26,108 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-co_file-18.i[919,932] [2024-10-11 10:20:26,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:20:26,170 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:20:26,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26 WrapperNode [2024-10-11 10:20:26,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:20:26,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:20:26,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:20:26,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:20:26,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,225 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-10-11 10:20:26,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:20:26,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:20:26,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:20:26,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:20:26,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,263 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:20:26,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:20:26,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:20:26,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:20:26,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:20:26,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (1/1) ... [2024-10-11 10:20:26,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:20:26,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:20:26,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:20:26,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:20:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:20:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:20:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:20:26,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:20:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:20:26,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:20:26,468 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:20:26,470 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:20:55,811 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 10:20:55,811 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:20:55,856 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:20:55,856 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:20:55,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:20:55 BoogieIcfgContainer [2024-10-11 10:20:55,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:20:55,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:20:55,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:20:55,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:20:55,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:20:25" (1/3) ... [2024-10-11 10:20:55,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20407957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:20:55, skipping insertion in model container [2024-10-11 10:20:55,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:20:26" (2/3) ... [2024-10-11 10:20:55,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20407957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:20:55, skipping insertion in model container [2024-10-11 10:20:55,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:20:55" (3/3) ... [2024-10-11 10:20:55,866 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-18.i [2024-10-11 10:20:55,881 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:20:55,881 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:20:55,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:20:55,958 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;@4e3e9235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:20:55,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:20:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:20:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 10:20:55,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:20:55,979 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:20:55,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:20:55,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:20:55,985 INFO L85 PathProgramCache]: Analyzing trace with hash 552903547, now seen corresponding path program 1 times [2024-10-11 10:20:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:20:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612455938] [2024-10-11 10:20:55,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:20:55,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:20:55,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:20:56,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:20:56,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:20:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:20:57,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:20:57,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:20:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-11 10:20:57,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:20:57,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:20:57,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612455938] [2024-10-11 10:20:57,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612455938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:20:57,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:20:57,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:20:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009015031] [2024-10-11 10:20:57,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:20:57,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:20:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:20:57,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:20:57,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:20:57,313 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 10:21:01,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:21:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:01,807 INFO L93 Difference]: Finished difference Result 163 states and 297 transitions. [2024-10-11 10:21:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:21:01,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2024-10-11 10:21:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:01,984 INFO L225 Difference]: With dead ends: 163 [2024-10-11 10:21:01,984 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 10:21:01,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:21:01,988 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:01,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 10:21:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 10:21:02,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 10:21:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:21:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2024-10-11 10:21:02,035 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 183 [2024-10-11 10:21:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:02,035 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2024-10-11 10:21:02,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 10:21:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2024-10-11 10:21:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 10:21:02,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:02,038 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:02,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:21:02,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:02,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:02,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash 661494833, now seen corresponding path program 1 times [2024-10-11 10:21:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:21:02,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595730456] [2024-10-11 10:21:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:02,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:02,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:21:02,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:21:02,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:21:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:03,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:21:03,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:21:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:21:10,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:21:10,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:21:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595730456] [2024-10-11 10:21:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595730456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:10,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:10,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:21:10,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127077403] [2024-10-11 10:21:10,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:10,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:21:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:21:10,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:21:10,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:10,257 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:21:14,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:21:18,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:21:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:19,179 INFO L93 Difference]: Finished difference Result 236 states and 383 transitions. [2024-10-11 10:21:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:21:19,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-10-11 10:21:19,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:19,182 INFO L225 Difference]: With dead ends: 236 [2024-10-11 10:21:19,182 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 10:21:19,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:19,184 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 39 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:19,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 239 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-10-11 10:21:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 10:21:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2024-10-11 10:21:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 73 states have internal predecessors, (96), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 10:21:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 212 transitions. [2024-10-11 10:21:19,204 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 212 transitions. Word has length 183 [2024-10-11 10:21:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:19,207 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 212 transitions. [2024-10-11 10:21:19,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:21:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 212 transitions. [2024-10-11 10:21:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 10:21:19,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:19,210 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:19,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:21:19,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:19,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:19,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1186123711, now seen corresponding path program 1 times [2024-10-11 10:21:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:21:19,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037299706] [2024-10-11 10:21:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:19,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:21:19,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:21:19,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:21:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:20,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:21:20,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:21:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:21:27,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:21:27,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:21:27,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037299706] [2024-10-11 10:21:27,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037299706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:27,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:27,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:21:27,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304390332] [2024-10-11 10:21:27,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:27,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:21:27,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:21:27,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:21:27,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:27,339 INFO L87 Difference]: Start difference. First operand 134 states and 212 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:21:31,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:21:36,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:21:40,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:21:44,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:21:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:44,674 INFO L93 Difference]: Finished difference Result 231 states and 373 transitions. [2024-10-11 10:21:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:21:44,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2024-10-11 10:21:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:44,735 INFO L225 Difference]: With dead ends: 231 [2024-10-11 10:21:44,735 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 10:21:44,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:44,737 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 27 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:44,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 236 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 4 Unknown, 0 Unchecked, 17.3s Time] [2024-10-11 10:21:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 10:21:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 138. [2024-10-11 10:21:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 10:21:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2024-10-11 10:21:44,753 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 218 transitions. Word has length 184 [2024-10-11 10:21:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:44,754 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 218 transitions. [2024-10-11 10:21:44,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:21:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 218 transitions. [2024-10-11 10:21:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 10:21:44,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:44,756 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:44,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 10:21:44,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:44,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash -751388405, now seen corresponding path program 1 times [2024-10-11 10:21:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:21:44,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159784950] [2024-10-11 10:21:44,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:44,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:44,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:21:44,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:21:44,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:21:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:46,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 10:21:46,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:21:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 810 proven. 33 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-11 10:21:56,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:21:57,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:21:57,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159784950] [2024-10-11 10:21:57,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159784950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:21:57,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1031102434] [2024-10-11 10:21:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:57,368 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:21:57,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:21:57,370 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:21:57,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 10:21:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:59,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:21:59,643 INFO L278 TraceCheckSpWp]: Computing forward predicates...