./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_fillercodesize_ps-cn-50_file-30.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_fillercodesize_ps-cn-50_file-30.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 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:43:26,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:43:26,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:43:26,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:43:26,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:43:26,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:43:26,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:43:26,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:43:26,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:43:26,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:43:26,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:43:26,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:43:26,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:43:26,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:43:26,237 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:43:26,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:43:26,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:43:26,238 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:43:26,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:43:26,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:43:26,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:43:26,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:43:26,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:43:26,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:43:26,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:43:26,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:43:26,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:43:26,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:43:26,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:43:26,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:43:26,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:43:26,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:43:26,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:43:26,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:43:26,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:43:26,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:43:26,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:43:26,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:43:26,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:43:26,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:43:26,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:43:26,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:43:26,250 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 -> 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc [2024-10-11 08:43:26,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:43:26,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:43:26,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:43:26,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:43:26,536 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:43:26,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2024-10-11 08:43:28,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:43:28,319 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:43:28,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2024-10-11 08:43:28,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/80efbd36c/0ed0f9e4c32540a183d2ac8516293a91/FLAGd8f643566 [2024-10-11 08:43:28,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/80efbd36c/0ed0f9e4c32540a183d2ac8516293a91 [2024-10-11 08:43:28,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:43:28,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:43:28,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:43:28,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:43:28,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:43:28,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513d6931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28, skipping insertion in model container [2024-10-11 08:43:28,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:43:28,575 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_fillercodesize_ps-cn-50_file-30.i[915,928] [2024-10-11 08:43:28,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:43:28,668 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:43:28,680 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_fillercodesize_ps-cn-50_file-30.i[915,928] [2024-10-11 08:43:28,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:43:28,737 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:43:28,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28 WrapperNode [2024-10-11 08:43:28,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:43:28,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:43:28,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:43:28,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:43:28,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,829 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2024-10-11 08:43:28,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:43:28,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:43:28,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:43:28,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:43:28,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,888 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 08:43:28,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:43:28,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:43:28,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:43:28,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:43:28,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (1/1) ... [2024-10-11 08:43:28,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:43:28,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:43:28,969 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 08:43:28,976 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 08:43:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:43:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:43:29,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:43:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:43:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:43:29,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:43:29,148 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:43:29,150 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:43:29,611 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 08:43:29,611 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:43:29,653 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:43:29,654 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:43:29,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:43:29 BoogieIcfgContainer [2024-10-11 08:43:29,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:43:29,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:43:29,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:43:29,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:43:29,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:43:28" (1/3) ... [2024-10-11 08:43:29,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4213c022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:43:29, skipping insertion in model container [2024-10-11 08:43:29,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:28" (2/3) ... [2024-10-11 08:43:29,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4213c022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:43:29, skipping insertion in model container [2024-10-11 08:43:29,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:43:29" (3/3) ... [2024-10-11 08:43:29,666 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2024-10-11 08:43:29,681 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:43:29,682 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:43:29,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:43:29,751 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;@5df5fc89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:43:29,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:43:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:43:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 08:43:29,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:43:29,781 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:29,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:43:29,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:43:29,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2032709563, now seen corresponding path program 1 times [2024-10-11 08:43:29,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:43:29,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771167342] [2024-10-11 08:43:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:43:29,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:43:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:43:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:43:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:43:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:43:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:43:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:43:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:43:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:43:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:43:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:43:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 08:43:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 08:43:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 08:43:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 08:43:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 08:43:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 08:43:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 08:43:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 08:43:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 08:43:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 08:43:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 08:43:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:43:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 08:43:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:43:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 08:43:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 08:43:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:43:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:43:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 08:43:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 08:43:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 08:43:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 08:43:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 08:43:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:43:30,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:43:30,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771167342] [2024-10-11 08:43:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771167342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:43:30,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:43:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:43:30,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94616646] [2024-10-11 08:43:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:43:30,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:43:30,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:43:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:43:30,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:43:30,468 INFO L87 Difference]: Start difference. First operand has 106 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 08:43:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:43:30,527 INFO L93 Difference]: Finished difference Result 209 states and 373 transitions. [2024-10-11 08:43:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:43:30,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 213 [2024-10-11 08:43:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:43:30,563 INFO L225 Difference]: With dead ends: 209 [2024-10-11 08:43:30,563 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 08:43:30,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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 08:43:30,576 INFO L432 NwaCegarLoop]: 163 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, 163 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 08:43:30,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:43:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 08:43:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 08:43:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 69 states have internal predecessors, (100), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:43:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 166 transitions. [2024-10-11 08:43:30,639 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 166 transitions. Word has length 213 [2024-10-11 08:43:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:43:30,640 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 166 transitions. [2024-10-11 08:43:30,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 08:43:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 166 transitions. [2024-10-11 08:43:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 08:43:30,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:43:30,646 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:30,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:43:30,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:43:30,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:43:30,666 INFO L85 PathProgramCache]: Analyzing trace with hash 712033265, now seen corresponding path program 1 times [2024-10-11 08:43:30,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:43:30,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587453195] [2024-10-11 08:43:30,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:43:30,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:43:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:43:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:43:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:43:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:43:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:30,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:43:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:43:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:43:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:43:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:43:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:43:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 08:43:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 08:43:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 08:43:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 08:43:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 08:43:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 08:43:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 08:43:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 08:43:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 08:43:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 08:43:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 08:43:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:43:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 08:43:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:43:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 08:43:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 08:43:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:43:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:43:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 08:43:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 08:43:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 08:43:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 08:43:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 08:43:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:43:31,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:43:31,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587453195] [2024-10-11 08:43:31,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587453195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:43:31,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:43:31,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:43:31,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395673654] [2024-10-11 08:43:31,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:43:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:43:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:43:31,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:43:31,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:43:31,154 INFO L87 Difference]: Start difference. First operand 104 states and 166 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:43:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:43:31,207 INFO L93 Difference]: Finished difference Result 208 states and 332 transitions. [2024-10-11 08:43:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:43:31,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-10-11 08:43:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:43:31,210 INFO L225 Difference]: With dead ends: 208 [2024-10-11 08:43:31,210 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 08:43:31,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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 08:43:31,218 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:43:31,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 159 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:43:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 08:43:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-11 08:43:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:43:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 165 transitions. [2024-10-11 08:43:31,244 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 165 transitions. Word has length 213 [2024-10-11 08:43:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:43:31,246 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 165 transitions. [2024-10-11 08:43:31,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:43:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 165 transitions. [2024-10-11 08:43:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 08:43:31,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:43:31,250 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:31,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:43:31,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:43:31,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:43:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash -888947018, now seen corresponding path program 1 times [2024-10-11 08:43:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:43:31,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309469965] [2024-10-11 08:43:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:43:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:43:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:43:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:43:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:43:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:43:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:43:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:43:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:43:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:43:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:43:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:43:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 08:43:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 08:43:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 08:43:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 08:43:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 08:43:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 08:43:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 08:43:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 08:43:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 08:43:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 08:43:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 08:43:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:43:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 08:43:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:43:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 08:43:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 08:43:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:43:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:43:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 08:43:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 08:43:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 08:43:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 08:43:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 08:43:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:43:31,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:43:31,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309469965] [2024-10-11 08:43:31,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309469965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:43:31,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:43:31,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:43:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663244613] [2024-10-11 08:43:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:43:31,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:43:31,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:43:31,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:43:31,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:43:31,634 INFO L87 Difference]: Start difference. First operand 104 states and 165 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:43:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:43:31,898 INFO L93 Difference]: Finished difference Result 269 states and 424 transitions. [2024-10-11 08:43:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:43:31,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-10-11 08:43:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:43:31,902 INFO L225 Difference]: With dead ends: 269 [2024-10-11 08:43:31,902 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 08:43:31,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:43:31,904 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 252 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:43:31,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 344 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:43:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 08:43:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2024-10-11 08:43:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:43:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 164 transitions. [2024-10-11 08:43:31,928 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 164 transitions. Word has length 214 [2024-10-11 08:43:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:43:31,932 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 164 transitions. [2024-10-11 08:43:31,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:43:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2024-10-11 08:43:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 08:43:31,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:43:31,936 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:31,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:43:31,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:43:31,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:43:31,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1817672376, now seen corresponding path program 1 times [2024-10-11 08:43:31,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:43:31,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210872844] [2024-10-11 08:43:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:43:31,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:43:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:43:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:43:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:43:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:43:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:43:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:43:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:43:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:43:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:43:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:43:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 08:43:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 08:43:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 08:43:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 08:43:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 08:43:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 08:43:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 08:43:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 08:43:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 08:43:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 08:43:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 08:43:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:43:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 08:43:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:43:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 08:43:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 08:43:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:43:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:43:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 08:43:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 08:43:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 08:43:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 08:43:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 08:43:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:43:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:43:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210872844] [2024-10-11 08:43:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210872844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:43:32,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:43:32,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:43:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984372158] [2024-10-11 08:43:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:43:32,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:43:32,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:43:32,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:43:32,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:43:32,469 INFO L87 Difference]: Start difference. First operand 104 states and 164 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:43:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:43:32,804 INFO L93 Difference]: Finished difference Result 338 states and 534 transitions. [2024-10-11 08:43:32,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 08:43:32,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-10-11 08:43:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:43:32,808 INFO L225 Difference]: With dead ends: 338 [2024-10-11 08:43:32,808 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 08:43:32,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:43:32,813 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 155 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:43:32,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 583 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:43:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 08:43:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 207. [2024-10-11 08:43:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 138 states have internal predecessors, (194), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 08:43:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 326 transitions. [2024-10-11 08:43:32,860 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 326 transitions. Word has length 214 [2024-10-11 08:43:32,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:43:32,861 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 326 transitions. [2024-10-11 08:43:32,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:43:32,861 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2024-10-11 08:43:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 08:43:32,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:43:32,864 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:32,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:43:32,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:43:32,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:43:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1890488906, now seen corresponding path program 1 times [2024-10-11 08:43:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:43:32,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073933553] [2024-10-11 08:43:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:43:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:43:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:43:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:43:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:43:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:43:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:43:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:43:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:43:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:43:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:43:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:43:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 08:43:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 08:43:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 08:43:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 08:43:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 08:43:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 08:43:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 08:43:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 08:43:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 08:43:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 08:43:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 08:43:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:43:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 08:43:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:43:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 08:43:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 08:43:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:43:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:43:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 08:43:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 08:43:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 08:43:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 08:43:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 08:43:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:43:33,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:43:33,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073933553] [2024-10-11 08:43:33,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073933553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:43:33,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:43:33,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:43:33,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140442496] [2024-10-11 08:43:33,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:43:33,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:43:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:43:33,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:43:33,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:43:33,275 INFO L87 Difference]: Start difference. First operand 207 states and 326 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:43:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:43:33,474 INFO L93 Difference]: Finished difference Result 442 states and 695 transitions. [2024-10-11 08:43:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:43:33,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-10-11 08:43:33,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:43:33,478 INFO L225 Difference]: With dead ends: 442 [2024-10-11 08:43:33,478 INFO L226 Difference]: Without dead ends: 337 [2024-10-11 08:43:33,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:43:33,480 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 116 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:43:33,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 471 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:43:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-11 08:43:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 282. [2024-10-11 08:43:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 179 states have (on average 1.3687150837988826) internal successors, (245), 179 states have internal predecessors, (245), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 08:43:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 443 transitions. [2024-10-11 08:43:33,551 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 443 transitions. Word has length 214 [2024-10-11 08:43:33,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:43:33,552 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 443 transitions. [2024-10-11 08:43:33,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:43:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 443 transitions. [2024-10-11 08:43:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:43:33,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:43:33,554 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:33,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:43:33,555 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:43:33,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:43:33,555 INFO L85 PathProgramCache]: Analyzing trace with hash 767756045, now seen corresponding path program 1 times [2024-10-11 08:43:33,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:43:33,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091587872] [2024-10-11 08:43:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:43:33,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:43:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:43:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:43:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:43:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:43:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:43:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:43:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:43:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:43:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:43:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:43:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 08:43:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 08:43:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 08:43:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 08:43:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 08:43:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 08:43:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 08:43:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 08:43:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 08:43:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 08:43:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 08:43:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:43:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 08:43:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:43:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 08:43:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 08:43:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:43:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:43:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 08:43:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 08:43:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 08:43:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 08:43:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 08:43:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 08:43:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:43:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091587872] [2024-10-11 08:43:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091587872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:43:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909586384] [2024-10-11 08:43:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:43:34,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:43:34,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:43:34,326 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 08:43:34,328 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 08:43:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:34,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 08:43:34,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:43:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 66 proven. 186 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:43:35,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:43:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 08:43:36,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909586384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:43:36,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:43:36,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-11 08:43:36,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168477979] [2024-10-11 08:43:36,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:43:36,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 08:43:36,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:43:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 08:43:36,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-11 08:43:36,071 INFO L87 Difference]: Start difference. First operand 282 states and 443 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) [2024-10-11 08:43:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:43:36,707 INFO L93 Difference]: Finished difference Result 518 states and 792 transitions. [2024-10-11 08:43:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 08:43:36,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) Word has length 215 [2024-10-11 08:43:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:43:36,711 INFO L225 Difference]: With dead ends: 518 [2024-10-11 08:43:36,711 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 08:43:36,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 488 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2024-10-11 08:43:36,712 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 243 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:43:36,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 478 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:43:36,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 08:43:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 306. [2024-10-11 08:43:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 197 states have (on average 1.3147208121827412) internal successors, (259), 197 states have internal predecessors, (259), 99 states have call successors, (99), 9 states have call predecessors, (99), 9 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 08:43:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 457 transitions. [2024-10-11 08:43:36,771 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 457 transitions. Word has length 215 [2024-10-11 08:43:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:43:36,773 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 457 transitions. [2024-10-11 08:43:36,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) [2024-10-11 08:43:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 457 transitions. [2024-10-11 08:43:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 08:43:36,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:43:36,776 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:36,797 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 08:43:36,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:43:36,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:43:36,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:43:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1759527408, now seen corresponding path program 1 times [2024-10-11 08:43:36,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:43:36,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654840086] [2024-10-11 08:43:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:43:36,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:43:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:43:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:43:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:43:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:43:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:43:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:43:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:43:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:43:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:43:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:43:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 08:43:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 08:43:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 08:43:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 08:43:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 08:43:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 08:43:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 08:43:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 08:43:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 08:43:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 08:43:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 08:43:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:43:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 08:43:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:43:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 08:43:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 08:43:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:43:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:43:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 08:43:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 08:43:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 08:43:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 08:43:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 08:43:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:43:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:43:37,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:43:37,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654840086] [2024-10-11 08:43:37,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654840086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:43:37,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:43:37,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:43:37,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621868436] [2024-10-11 08:43:37,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:43:37,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:43:37,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:43:37,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:43:37,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:43:37,162 INFO L87 Difference]: Start difference. First operand 306 states and 457 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:43:37,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:43:37,268 INFO L93 Difference]: Finished difference Result 528 states and 790 transitions. [2024-10-11 08:43:37,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:43:37,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2024-10-11 08:43:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:43:37,272 INFO L225 Difference]: With dead ends: 528 [2024-10-11 08:43:37,272 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 08:43:37,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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 08:43:37,275 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:43:37,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:43:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 08:43:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-10-11 08:43:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 197 states have (on average 1.3045685279187818) internal successors, (257), 197 states have internal predecessors, (257), 99 states have call successors, (99), 9 states have call predecessors, (99), 9 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 08:43:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 455 transitions. [2024-10-11 08:43:37,341 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 455 transitions. Word has length 216 [2024-10-11 08:43:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:43:37,341 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 455 transitions. [2024-10-11 08:43:37,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:43:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 455 transitions. [2024-10-11 08:43:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 08:43:37,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:43:37,346 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:43:37,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 08:43:37,346 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:43:37,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:43:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1626584606, now seen corresponding path program 1 times [2024-10-11 08:43:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:43:37,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856238105] [2024-10-11 08:43:37,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:43:37,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:43:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:43:37,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:43:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:43:37,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:43:37,575 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:43:37,575 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:43:37,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 08:43:37,582 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:43:37,720 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:43:37,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:43:37 BoogieIcfgContainer [2024-10-11 08:43:37,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:43:37,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:43:37,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:43:37,724 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:43:37,725 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:43:29" (3/4) ... [2024-10-11 08:43:37,726 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:43:37,727 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:43:37,728 INFO L158 Benchmark]: Toolchain (without parser) took 9373.71ms. Allocated memory was 138.4MB in the beginning and 257.9MB in the end (delta: 119.5MB). Free memory was 67.0MB in the beginning and 99.2MB in the end (delta: -32.2MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2024-10-11 08:43:37,728 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 138.4MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:43:37,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.14ms. Allocated memory is still 138.4MB. Free memory was 66.7MB in the beginning and 49.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:43:37,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.95ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 49.8MB in the beginning and 146.6MB in the end (delta: -96.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 08:43:37,729 INFO L158 Benchmark]: Boogie Preprocessor took 94.91ms. Allocated memory is still 178.3MB. Free memory was 146.6MB in the beginning and 143.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:43:37,729 INFO L158 Benchmark]: RCFGBuilder took 728.74ms. Allocated memory is still 178.3MB. Free memory was 143.4MB in the beginning and 116.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 08:43:37,729 INFO L158 Benchmark]: TraceAbstraction took 8066.03ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 115.1MB in the beginning and 99.2MB in the end (delta: 15.9MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2024-10-11 08:43:37,729 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 257.9MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:43:37,731 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 138.4MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.14ms. Allocated memory is still 138.4MB. Free memory was 66.7MB in the beginning and 49.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.95ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 49.8MB in the beginning and 146.6MB in the end (delta: -96.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.91ms. Allocated memory is still 178.3MB. Free memory was 146.6MB in the beginning and 143.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 728.74ms. Allocated memory is still 178.3MB. Free memory was 143.4MB in the beginning and 116.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8066.03ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 115.1MB in the beginning and 99.2MB in the end (delta: 15.9MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 257.9MB. Free memory is still 99.2MB. 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 201, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 221, overapproximation of someBinaryArithmeticFLOAToperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_20 = 256.75; [L37] double var_1_21 = 100.4; [L38] double var_1_22 = 4.5; [L39] double var_1_23 = -0.5; [L40] signed long int var_1_24 = 10; [L41] signed char var_1_25 = -8; [L42] double var_1_26 = 9.75; [L43] unsigned char var_1_27 = 1; [L44] signed char var_1_28 = 8; [L45] unsigned long int var_1_29 = 16; [L46] unsigned long int var_1_30 = 1; [L47] float var_1_31 = 16.6; [L48] unsigned char var_1_32 = 0; [L49] float var_1_33 = 0.25; [L50] float var_1_34 = 99.8; [L51] signed short int var_1_35 = 256; [L52] unsigned long int var_1_36 = 16; [L53] double var_1_37 = 8.5; [L54] unsigned long int var_1_38 = 3569725445; [L55] unsigned long int var_1_39 = 3551809449; [L56] unsigned long int var_1_40 = 10000000; [L57] unsigned char last_1_var_1_1 = 1; [L58] signed long int last_1_var_1_11 = -2; [L59] signed long int last_1_var_1_15 = 1000; [L60] double last_1_var_1_16 = 0.2; [L225] isInitial = 1 [L226] FCALL initially() [L227] COND TRUE 1 [L228] CALL updateLastVariables() [L215] last_1_var_1_1 = var_1_1 [L216] last_1_var_1_11 = var_1_11 [L217] last_1_var_1_15 = var_1_15 [L218] last_1_var_1_16 = var_1_16 [L228] RET updateLastVariables() [L229] CALL updateVariables() [L158] var_1_4 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L159] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L160] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L160] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L161] var_1_7 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] var_1_10 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L164] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] var_1_13 = __VERIFIER_nondet_long() [L166] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L168] var_1_14 = __VERIFIER_nondet_long() [L169] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L171] var_1_17 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L173] var_1_18 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] var_1_20 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L176] RET assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] var_1_21 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L179] var_1_22 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L181] var_1_23 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L182] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L183] var_1_26 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L184] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L185] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L185] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L186] var_1_27 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L187] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L188] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L188] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L189] var_1_28 = __VERIFIER_nondet_char() [L190] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L190] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L191] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L191] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L192] var_1_30 = __VERIFIER_nondet_ulong() [L193] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L193] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L194] CALL assume_abort_if_not(var_1_30 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L194] RET assume_abort_if_not(var_1_30 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L195] var_1_32 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L196] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L197] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L197] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L198] var_1_33 = __VERIFIER_nondet_float() [L199] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L199] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L200] var_1_34 = __VERIFIER_nondet_float() [L201] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L201] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L202] var_1_37 = __VERIFIER_nondet_double() [L203] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L203] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L204] var_1_38 = __VERIFIER_nondet_ulong() [L205] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L205] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L206] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L206] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L207] var_1_39 = __VERIFIER_nondet_ulong() [L208] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L208] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L209] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L209] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L210] var_1_40 = __VERIFIER_nondet_ulong() [L211] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L211] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L212] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L212] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L229] RET updateVariables() [L230] CALL step() [L64] COND TRUE (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) - var_1_21) == (var_1_22 * var_1_23) [L65] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L67] var_1_24 = var_1_19 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L68] COND TRUE var_1_21 != var_1_23 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L69] COND TRUE var_1_20 < (var_1_22 / var_1_26) [L70] var_1_25 = ((((4) < 0 ) ? -(4) : (4))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L81] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L82] COND FALSE !(var_1_22 > var_1_23) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L89] COND TRUE \read(var_1_27) [L90] var_1_31 = ((((((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) < 0 ) ? -((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) : ((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))))) - 256.35f) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L93] COND TRUE ! ((1 + var_1_24) <= var_1_19) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L94] COND FALSE !(var_1_24 > (((((((-5) < 0 ) ? -(-5) : (-5))) < 0 ) ? -((((-5) < 0 ) ? -(-5) : (-5))) : ((((-5) < 0 ) ? -(-5) : (-5)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L98] COND FALSE !(var_1_21 < var_1_23) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L105] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L106] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L107] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L112] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L113] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L114] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L116] signed long int stepLocal_2 = var_1_11; [L117] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=4, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L118] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=4, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L119] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L120] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L121] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L127] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L127] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L138] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L140] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L141] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L145] COND FALSE !(10.55f < var_1_16) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L150] COND TRUE var_1_16 > var_1_7 [L151] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] [L230] RET step() [L231] CALL, EXPR property() [L221] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] [L221-L222] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L231] RET, EXPR property() [L231] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=4, var_1_13=0, var_1_14=4, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 8, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 924 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 923 mSDsluCounter, 2491 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1300 mSDsCounter, 402 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582 IncrementalHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 402 mSolverCounterUnsat, 1191 mSDtfsCounter, 582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 968 GetRequests, 931 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 152 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1931 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1920 ConstructedInterpolants, 0 QuantifiedInterpolants, 6808 SizeOfPredicates, 3 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 18630/19008 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 08:43:37,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_fillercodesize_ps-cn-50_file-30.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 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:43:40,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:43:40,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:43:40,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:43:40,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:43:40,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:43:40,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:43:40,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:43:40,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:43:40,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:43:40,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:43:40,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:43:40,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:43:40,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:43:40,180 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:43:40,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:43:40,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:43:40,181 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:43:40,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:43:40,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:43:40,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:43:40,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:43:40,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:43:40,186 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:43:40,186 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:43:40,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:43:40,187 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:43:40,187 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:43:40,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:43:40,187 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:43:40,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:43:40,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:43:40,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:43:40,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:43:40,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:43:40,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:43:40,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:43:40,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:43:40,202 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:43:40,203 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:43:40,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:43:40,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:43:40,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:43:40,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:43:40,205 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:43:40,206 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 -> 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc [2024-10-11 08:43:40,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:43:40,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:43:40,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:43:40,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:43:40,591 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:43:40,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2024-10-11 08:43:42,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:43:42,513 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:43:42,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2024-10-11 08:43:42,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0722ead09/0ca61a01e6ef4aba975b2e553c415775/FLAGf5f258f00 [2024-10-11 08:43:42,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0722ead09/0ca61a01e6ef4aba975b2e553c415775 [2024-10-11 08:43:42,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:43:42,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:43:42,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:43:42,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:43:42,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:43:42,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:43:42" (1/1) ... [2024-10-11 08:43:42,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307b363c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:42, skipping insertion in model container [2024-10-11 08:43:42,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:43:42" (1/1) ... [2024-10-11 08:43:42,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:43:43,087 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_fillercodesize_ps-cn-50_file-30.i[915,928] [2024-10-11 08:43:43,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:43:43,203 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:43:43,216 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_fillercodesize_ps-cn-50_file-30.i[915,928] [2024-10-11 08:43:43,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:43:43,293 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:43:43,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43 WrapperNode [2024-10-11 08:43:43,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:43:43,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:43:43,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:43:43,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:43:43,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,369 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2024-10-11 08:43:43,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:43:43,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:43:43,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:43:43,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:43:43,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,434 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 08:43:43,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:43:43,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:43:43,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:43:43,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:43:43,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (1/1) ... [2024-10-11 08:43:43,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:43:43,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:43:43,517 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 08:43:43,521 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 08:43:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:43:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:43:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:43:43,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:43:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:43:43,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:43:43,695 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:43:43,698 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:44:10,979 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 08:44:10,980 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:44:11,039 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:44:11,039 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:44:11,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:44:11 BoogieIcfgContainer [2024-10-11 08:44:11,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:44:11,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:44:11,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:44:11,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:44:11,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:43:42" (1/3) ... [2024-10-11 08:44:11,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b58ad1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:44:11, skipping insertion in model container [2024-10-11 08:44:11,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:43:43" (2/3) ... [2024-10-11 08:44:11,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b58ad1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:44:11, skipping insertion in model container [2024-10-11 08:44:11,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:44:11" (3/3) ... [2024-10-11 08:44:11,052 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2024-10-11 08:44:11,070 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:44:11,070 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:44:11,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:44:11,167 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;@6cd54c8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:44:11,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:44:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:44:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 08:44:11,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:11,192 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:44:11,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:11,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1303543091, now seen corresponding path program 1 times [2024-10-11 08:44:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:44:11,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522802715] [2024-10-11 08:44:11,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:11,210 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 08:44:11,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:44:11,214 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 08:44:11,215 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 08:44:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:12,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:44:12,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:44:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2024-10-11 08:44:12,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:44:12,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:44:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522802715] [2024-10-11 08:44:12,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522802715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:12,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:12,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:44:12,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307981292] [2024-10-11 08:44:12,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:12,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:44:12,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:44:12,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:44:12,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:44:12,891 INFO L87 Difference]: Start difference. First operand has 97 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 08:44:17,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:44:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:17,542 INFO L93 Difference]: Finished difference Result 191 states and 345 transitions. [2024-10-11 08:44:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:44:17,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 210 [2024-10-11 08:44:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:17,601 INFO L225 Difference]: With dead ends: 191 [2024-10-11 08:44:17,602 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 08:44:17,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 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 08:44:17,608 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:17,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 08:44:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 08:44:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 08:44:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:44:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 152 transitions. [2024-10-11 08:44:17,659 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 152 transitions. Word has length 210 [2024-10-11 08:44:17,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:17,660 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 152 transitions. [2024-10-11 08:44:17,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 08:44:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 152 transitions. [2024-10-11 08:44:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 08:44:17,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:17,665 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:44:17,703 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 08:44:17,866 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 08:44:17,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:17,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:17,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1872049577, now seen corresponding path program 1 times [2024-10-11 08:44:17,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:44:17,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409982324] [2024-10-11 08:44:17,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:17,869 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 08:44:17,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:44:17,872 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 08:44:17,874 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 08:44:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:19,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 08:44:19,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:44:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:44:19,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:44:19,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:44:19,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409982324] [2024-10-11 08:44:19,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409982324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:19,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:19,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:44:19,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239147132] [2024-10-11 08:44:19,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:19,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:44:19,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:44:19,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:44:19,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:44:19,906 INFO L87 Difference]: Start difference. First operand 95 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:44:24,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:44:28,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:44:32,379 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 08:44:33,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:44:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:34,096 INFO L93 Difference]: Finished difference Result 284 states and 455 transitions. [2024-10-11 08:44:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:44:34,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-11 08:44:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:34,104 INFO L225 Difference]: With dead ends: 284 [2024-10-11 08:44:34,104 INFO L226 Difference]: Without dead ends: 190 [2024-10-11 08:44:34,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:44:34,110 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 218 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 68 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:34,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 420 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 14.1s Time] [2024-10-11 08:44:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-11 08:44:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-10-11 08:44:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 118 states have (on average 1.423728813559322) internal successors, (168), 118 states have internal predecessors, (168), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 08:44:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 300 transitions. [2024-10-11 08:44:34,170 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 300 transitions. Word has length 210 [2024-10-11 08:44:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:34,171 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 300 transitions. [2024-10-11 08:44:34,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:44:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 300 transitions. [2024-10-11 08:44:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 08:44:34,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:34,175 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:44:34,224 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 08:44:34,375 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 08:44:34,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:34,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1449347751, now seen corresponding path program 1 times [2024-10-11 08:44:34,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:44:34,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717754729] [2024-10-11 08:44:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:34,378 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 08:44:34,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:44:34,381 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 08:44:34,382 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 08:44:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:35,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 08:44:35,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:44:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:44:40,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:44:40,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:44:40,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717754729] [2024-10-11 08:44:40,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717754729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:40,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:40,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:44:40,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749452426] [2024-10-11 08:44:40,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:40,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:44:40,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:44:40,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:44:40,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:44:40,380 INFO L87 Difference]: Start difference. First operand 187 states and 300 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:44:46,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:44:50,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:44:54,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []