./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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:42:36,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:42:36,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:42:36,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:42:36,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:42:36,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:42:36,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:42:36,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:42:36,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:42:36,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:42:36,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:42:36,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:42:36,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:42:36,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:42:36,715 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:42:36,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:42:36,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:42:36,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:42:36,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:42:36,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:42:36,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:42:36,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:42:36,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:42:36,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:42:36,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:42:36,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:42:36,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:42:36,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:42:36,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:42:36,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:42:36,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:42:36,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:42:36,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:42:36,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:42:36,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:42:36,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:42:36,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:42:36,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:42:36,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:42:36,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:42:36,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:42:36,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:42:36,731 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc [2024-10-24 06:42:37,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:42:37,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:42:37,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:42:37,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:42:37,048 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:42:37,049 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-24 06:42:38,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:42:38,845 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:42:38,846 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-24 06:42:38,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b979327/2cf109a5c80741a0b335b69713d1d62d/FLAGff9f355ff [2024-10-24 06:42:39,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b979327/2cf109a5c80741a0b335b69713d1d62d [2024-10-24 06:42:39,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:42:39,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:42:39,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:42:39,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:42:39,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:42:39,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1a6d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39, skipping insertion in model container [2024-10-24 06:42:39,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:42:39,452 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-24 06:42:39,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:42:39,662 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:42:39,681 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-24 06:42:39,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:42:39,768 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:42:39,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39 WrapperNode [2024-10-24 06:42:39,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:42:39,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:42:39,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:42:39,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:42:39,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,827 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2024-10-24 06:42:39,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:42:39,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:42:39,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:42:39,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:42:39,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,872 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-24 06:42:39,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:42:39,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:42:39,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:42:39,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:42:39,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (1/1) ... [2024-10-24 06:42:39,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:42:39,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:42:39,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:42:39,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:42:39,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:42:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:42:39,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:42:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:42:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:42:39,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:42:40,097 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:42:40,099 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:42:40,513 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 06:42:40,514 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:42:40,560 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:42:40,561 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:42:40,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:42:40 BoogieIcfgContainer [2024-10-24 06:42:40,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:42:40,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:42:40,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:42:40,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:42:40,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:42:39" (1/3) ... [2024-10-24 06:42:40,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4a344f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:42:40, skipping insertion in model container [2024-10-24 06:42:40,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:39" (2/3) ... [2024-10-24 06:42:40,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4a344f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:42:40, skipping insertion in model container [2024-10-24 06:42:40,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:42:40" (3/3) ... [2024-10-24 06:42:40,575 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2024-10-24 06:42:40,588 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:42:40,589 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:42:40,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:42:40,667 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;@19a9f47b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:42:40,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:42:40,671 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-24 06:42:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 06:42:40,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:42:40,690 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-24 06:42:40,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:42:40,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:42:40,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2032709563, now seen corresponding path program 1 times [2024-10-24 06:42:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:42:40,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573054946] [2024-10-24 06:42:40,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:42:40,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:42:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:42:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:42:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:42:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:42:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:42:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:42:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:42:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:42:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:42:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:42:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:42:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:42:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:42:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:42:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:42:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:42:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:42:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:42:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:42:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:42:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:42:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:42:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:42:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:42:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:42:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 06:42:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 06:42:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 06:42:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 06:42:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 06:42:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 06:42:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 06:42:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 06:42:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,413 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-24 06:42:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:42:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573054946] [2024-10-24 06:42:41,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573054946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:42:41,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:42:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:42:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389125942] [2024-10-24 06:42:41,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:42:41,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:42:41,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:42:41,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:42:41,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:42:41,452 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-24 06:42:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:42:41,519 INFO L93 Difference]: Finished difference Result 209 states and 373 transitions. [2024-10-24 06:42:41,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:42:41,523 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-24 06:42:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:42:41,534 INFO L225 Difference]: With dead ends: 209 [2024-10-24 06:42:41,536 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 06:42:41,544 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-24 06:42:41,550 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-24 06:42:41,552 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-24 06:42:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 06:42:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 06:42:41,609 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-24 06:42:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 166 transitions. [2024-10-24 06:42:41,616 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 166 transitions. Word has length 213 [2024-10-24 06:42:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:42:41,616 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 166 transitions. [2024-10-24 06:42:41,617 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-24 06:42:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 166 transitions. [2024-10-24 06:42:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 06:42:41,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:42:41,622 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-24 06:42:41,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:42:41,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:42:41,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:42:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash 712033265, now seen corresponding path program 1 times [2024-10-24 06:42:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:42:41,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862802093] [2024-10-24 06:42:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:42:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:42:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:42:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:42:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:42:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:42:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:42:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:42:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:42:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:42:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:42:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:42:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:42:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:42:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:42:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:42:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:42:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:42:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:41,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:42:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:42:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:42:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:42:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:42:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:42:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:42:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:42:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:42:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 06:42:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 06:42:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 06:42:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 06:42:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 06:42:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 06:42:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 06:42:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 06:42:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,088 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-24 06:42:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:42:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862802093] [2024-10-24 06:42:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862802093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:42:42,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:42:42,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:42:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348419471] [2024-10-24 06:42:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:42:42,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:42:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:42:42,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:42:42,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:42:42,100 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-24 06:42:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:42:42,142 INFO L93 Difference]: Finished difference Result 208 states and 332 transitions. [2024-10-24 06:42:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:42:42,143 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-24 06:42:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:42:42,145 INFO L225 Difference]: With dead ends: 208 [2024-10-24 06:42:42,146 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 06:42:42,147 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-24 06:42:42,148 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-24 06:42:42,148 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-24 06:42:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 06:42:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-24 06:42:42,167 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-24 06:42:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 165 transitions. [2024-10-24 06:42:42,172 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 165 transitions. Word has length 213 [2024-10-24 06:42:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:42:42,177 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 165 transitions. [2024-10-24 06:42:42,177 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-24 06:42:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 165 transitions. [2024-10-24 06:42:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 06:42:42,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:42:42,185 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-24 06:42:42,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:42:42,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:42:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:42:42,186 INFO L85 PathProgramCache]: Analyzing trace with hash -888947018, now seen corresponding path program 1 times [2024-10-24 06:42:42,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:42:42,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719623485] [2024-10-24 06:42:42,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:42:42,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:42:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:42:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:42:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:42:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:42:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:42:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:42:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:42:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:42:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:42:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:42:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:42:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:42:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:42:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:42:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:42:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:42:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:42:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:42:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:42:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:42:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:42:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:42:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:42:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:42:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:42:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 06:42:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 06:42:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 06:42:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 06:42:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 06:42:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 06:42:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 06:42:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 06:42:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:42,526 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-24 06:42:42,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:42:42,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719623485] [2024-10-24 06:42:42,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719623485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:42:42,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:42:42,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:42:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683321924] [2024-10-24 06:42:42,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:42:42,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:42:42,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:42:42,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:42:42,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:42:42,532 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-24 06:42:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:42:42,810 INFO L93 Difference]: Finished difference Result 269 states and 424 transitions. [2024-10-24 06:42:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:42:42,811 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-24 06:42:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:42:42,814 INFO L225 Difference]: With dead ends: 269 [2024-10-24 06:42:42,814 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 06:42:42,818 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-24 06:42:42,819 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-24 06:42:42,823 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-24 06:42:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 06:42:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2024-10-24 06:42:42,844 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-24 06:42:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 164 transitions. [2024-10-24 06:42:42,846 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 164 transitions. Word has length 214 [2024-10-24 06:42:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:42:42,847 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 164 transitions. [2024-10-24 06:42:42,847 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-24 06:42:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2024-10-24 06:42:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 06:42:42,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:42:42,850 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-24 06:42:42,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:42:42,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:42:42,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:42:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1817672376, now seen corresponding path program 1 times [2024-10-24 06:42:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:42:42,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918451743] [2024-10-24 06:42:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:42:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:42:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:42:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:42:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:42:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:42:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:42:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:42:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:42:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:42:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:42:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:42:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:42:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:42:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:42:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:42:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:42:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:42:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:42:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:42:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:42:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:42:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:42:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:42:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:42:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:42:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:42:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 06:42:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 06:42:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 06:42:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 06:42:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 06:42:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 06:42:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 06:42:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 06:42:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,259 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-24 06:42:43,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:42:43,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918451743] [2024-10-24 06:42:43,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918451743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:42:43,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:42:43,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:42:43,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501147875] [2024-10-24 06:42:43,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:42:43,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:42:43,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:42:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:42:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:42:43,264 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-24 06:42:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:42:43,628 INFO L93 Difference]: Finished difference Result 338 states and 534 transitions. [2024-10-24 06:42:43,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 06:42:43,628 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-24 06:42:43,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:42:43,631 INFO L225 Difference]: With dead ends: 338 [2024-10-24 06:42:43,634 INFO L226 Difference]: Without dead ends: 235 [2024-10-24 06:42:43,635 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-24 06:42:43,636 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-24 06:42:43,636 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-24 06:42:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-24 06:42:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 207. [2024-10-24 06:42:43,700 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-24 06:42:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 326 transitions. [2024-10-24 06:42:43,704 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 326 transitions. Word has length 214 [2024-10-24 06:42:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:42:43,705 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 326 transitions. [2024-10-24 06:42:43,705 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-24 06:42:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2024-10-24 06:42:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 06:42:43,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:42:43,710 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-24 06:42:43,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:42:43,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:42:43,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:42:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1890488906, now seen corresponding path program 1 times [2024-10-24 06:42:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:42:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4133816] [2024-10-24 06:42:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:42:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:42:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:42:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:42:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:42:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:42:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:42:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:42:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:42:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:42:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:42:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:42:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:42:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:42:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:42:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:42:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:42:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:42:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:42:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:42:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:42:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:42:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:42:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:42:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:42:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:42:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:42:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 06:42:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 06:42:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 06:42:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 06:42:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 06:42:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 06:42:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 06:42:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 06:42:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:44,125 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-24 06:42:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:42:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4133816] [2024-10-24 06:42:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4133816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:42:44,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:42:44,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:42:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519550436] [2024-10-24 06:42:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:42:44,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:42:44,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:42:44,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:42:44,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:42:44,129 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-24 06:42:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:42:44,350 INFO L93 Difference]: Finished difference Result 442 states and 695 transitions. [2024-10-24 06:42:44,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:42:44,350 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-24 06:42:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:42:44,353 INFO L225 Difference]: With dead ends: 442 [2024-10-24 06:42:44,353 INFO L226 Difference]: Without dead ends: 337 [2024-10-24 06:42:44,354 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-24 06:42:44,355 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.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:42:44,355 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.2s Time] [2024-10-24 06:42:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-24 06:42:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 282. [2024-10-24 06:42:44,429 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-24 06:42:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 443 transitions. [2024-10-24 06:42:44,433 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 443 transitions. Word has length 214 [2024-10-24 06:42:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:42:44,434 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 443 transitions. [2024-10-24 06:42:44,435 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-24 06:42:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 443 transitions. [2024-10-24 06:42:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 06:42:44,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:42:44,437 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-24 06:42:44,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:42:44,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:42:44,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:42:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash 767756045, now seen corresponding path program 1 times [2024-10-24 06:42:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:42:44,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090065194] [2024-10-24 06:42:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:42:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:42:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:42:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:42:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:42:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:42:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:42:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:42:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:42:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:42:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:42:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:42:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:42:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:42:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:42:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:42:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:42:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:42:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:42:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:42:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:42:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:42:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:42:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:42:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:42:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:42:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:42:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 06:42:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 06:42:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 06:42:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 06:42:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 06:42:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 06:42:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 06:42:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 06:42:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,177 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-24 06:42:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:42:45,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090065194] [2024-10-24 06:42:45,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090065194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:42:45,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303995173] [2024-10-24 06:42:45,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:42:45,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:42:45,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:42:45,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:42:45,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 06:42:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:45,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 06:42:45,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:42:45,884 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-24 06:42:45,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:42:46,253 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-24 06:42:46,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303995173] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:42:46,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:42:46,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-24 06:42:46,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646045179] [2024-10-24 06:42:46,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:42:46,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 06:42:46,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:42:46,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 06:42:46,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-24 06:42:46,257 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-24 06:42:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:42:46,760 INFO L93 Difference]: Finished difference Result 518 states and 792 transitions. [2024-10-24 06:42:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 06:42:46,761 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-24 06:42:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:42:46,765 INFO L225 Difference]: With dead ends: 518 [2024-10-24 06:42:46,766 INFO L226 Difference]: Without dead ends: 312 [2024-10-24 06:42:46,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 489 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2024-10-24 06:42:46,769 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.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:42:46,769 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.3s Time] [2024-10-24 06:42:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-24 06:42:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 306. [2024-10-24 06:42:46,830 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-24 06:42:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 457 transitions. [2024-10-24 06:42:46,832 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 457 transitions. Word has length 215 [2024-10-24 06:42:46,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:42:46,836 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 457 transitions. [2024-10-24 06:42:46,836 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-24 06:42:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 457 transitions. [2024-10-24 06:42:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-24 06:42:46,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:42:46,840 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-24 06:42:46,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 06:42:47,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 06:42:47,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:42:47,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:42:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1759527408, now seen corresponding path program 1 times [2024-10-24 06:42:47,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:42:47,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573705296] [2024-10-24 06:42:47,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:42:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:42:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:42:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:42:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:42:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:42:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:42:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:42:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:42:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:42:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:42:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:42:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:42:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:42:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:42:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:42:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:42:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:42:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:42:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:42:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:42:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:42:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:42:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:42:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:42:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:42:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:42:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 06:42:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 06:42:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 06:42:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 06:42:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 06:42:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 06:42:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 06:42:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 06:42:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:42:47,246 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-24 06:42:47,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:42:47,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573705296] [2024-10-24 06:42:47,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573705296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:42:47,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:42:47,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:42:47,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922705286] [2024-10-24 06:42:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:42:47,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:42:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:42:47,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:42:47,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:42:47,249 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-24 06:42:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:42:47,316 INFO L93 Difference]: Finished difference Result 528 states and 790 transitions. [2024-10-24 06:42:47,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:42:47,317 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-24 06:42:47,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:42:47,320 INFO L225 Difference]: With dead ends: 528 [2024-10-24 06:42:47,320 INFO L226 Difference]: Without dead ends: 306 [2024-10-24 06:42:47,321 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-24 06:42:47,323 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-24 06:42:47,323 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-24 06:42:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-24 06:42:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-10-24 06:42:47,368 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-24 06:42:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 455 transitions. [2024-10-24 06:42:47,371 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 455 transitions. Word has length 216 [2024-10-24 06:42:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:42:47,372 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 455 transitions. [2024-10-24 06:42:47,372 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-24 06:42:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 455 transitions. [2024-10-24 06:42:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-24 06:42:47,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:42:47,375 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-24 06:42:47,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 06:42:47,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:42:47,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:42:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1626584606, now seen corresponding path program 1 times [2024-10-24 06:42:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:42:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557227725] [2024-10-24 06:42:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:42:47,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:42:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:42:47,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:42:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:42:47,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:42:47,656 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:42:47,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:42:47,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 06:42:47,662 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:42:47,836 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:42:47,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:42:47 BoogieIcfgContainer [2024-10-24 06:42:47,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:42:47,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:42:47,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:42:47,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:42:47,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:42:40" (3/4) ... [2024-10-24 06:42:47,845 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:42:47,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:42:47,846 INFO L158 Benchmark]: Toolchain (without parser) took 8642.34ms. Allocated memory was 169.9MB in the beginning and 287.3MB in the end (delta: 117.4MB). Free memory was 111.3MB in the beginning and 223.3MB in the end (delta: -112.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-10-24 06:42:47,848 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:42:47,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.15ms. Allocated memory is still 169.9MB. Free memory was 110.9MB in the beginning and 133.7MB in the end (delta: -22.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 06:42:47,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.71ms. Allocated memory is still 169.9MB. Free memory was 133.7MB in the beginning and 130.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:42:47,849 INFO L158 Benchmark]: Boogie Preprocessor took 65.97ms. Allocated memory is still 169.9MB. Free memory was 130.2MB in the beginning and 127.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:42:47,849 INFO L158 Benchmark]: RCFGBuilder took 665.96ms. Allocated memory is still 169.9MB. Free memory was 127.4MB in the beginning and 98.8MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 06:42:47,849 INFO L158 Benchmark]: TraceAbstraction took 7278.03ms. Allocated memory was 169.9MB in the beginning and 287.3MB in the end (delta: 117.4MB). Free memory was 98.8MB in the beginning and 223.3MB in the end (delta: -124.5MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. [2024-10-24 06:42:47,849 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 287.3MB. Free memory is still 223.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:42:47,851 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.15ms. Allocated memory is still 169.9MB. Free memory was 110.9MB in the beginning and 133.7MB in the end (delta: -22.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.71ms. Allocated memory is still 169.9MB. Free memory was 133.7MB in the beginning and 130.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.97ms. Allocated memory is still 169.9MB. Free memory was 130.2MB in the beginning and 127.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 665.96ms. Allocated memory is still 169.9MB. Free memory was 127.4MB in the beginning and 98.8MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7278.03ms. Allocated memory was 169.9MB in the beginning and 287.3MB in the end (delta: 117.4MB). Free memory was 98.8MB in the beginning and 223.3MB in the end (delta: -124.5MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 287.3MB. Free memory is still 223.3MB. 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.0s, OverallIterations: 8, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, 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, 932 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s 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, 3.6s InterpolantComputationTime, 1931 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1920 ConstructedInterpolants, 0 QuantifiedInterpolants, 4256 SizeOfPredicates, 1 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-24 06:42:47,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:42:50,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:42:50,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:42:50,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:42:50,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:42:50,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:42:50,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:42:50,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:42:50,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:42:50,352 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:42:50,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:42:50,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:42:50,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:42:50,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:42:50,354 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:42:50,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:42:50,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:42:50,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:42:50,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:42:50,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:42:50,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:42:50,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:42:50,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:42:50,357 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:42:50,357 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:42:50,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:42:50,358 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:42:50,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:42:50,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:42:50,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:42:50,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:42:50,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:42:50,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:42:50,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:42:50,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:42:50,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:42:50,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:42:50,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:42:50,362 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:42:50,362 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:42:50,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:42:50,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:42:50,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:42:50,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:42:50,365 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:42:50,366 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc [2024-10-24 06:42:50,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:42:50,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:42:50,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:42:50,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:42:50,744 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:42:50,746 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-24 06:42:52,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:42:52,659 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:42:52,660 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-24 06:42:52,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa4ad0b1/6e05ee4749fa480c98d927f963cc2efd/FLAG9f1a43789 [2024-10-24 06:42:53,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa4ad0b1/6e05ee4749fa480c98d927f963cc2efd [2024-10-24 06:42:53,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:42:53,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:42:53,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:42:53,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:42:53,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:42:53,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fcce97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53, skipping insertion in model container [2024-10-24 06:42:53,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:42:53,285 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-24 06:42:53,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:42:53,399 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:42:53,411 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-24 06:42:53,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:42:53,503 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:42:53,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53 WrapperNode [2024-10-24 06:42:53,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:42:53,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:42:53,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:42:53,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:42:53,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,582 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2024-10-24 06:42:53,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:42:53,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:42:53,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:42:53,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:42:53,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,636 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-24 06:42:53,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:42:53,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:42:53,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:42:53,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:42:53,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (1/1) ... [2024-10-24 06:42:53,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:42:53,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:42:53,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:42:53,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:42:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:42:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:42:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:42:53,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:42:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:42:53,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:42:53,893 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:42:53,898 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:43:20,285 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 06:43:20,286 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:43:20,351 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:43:20,352 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:43:20,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:43:20 BoogieIcfgContainer [2024-10-24 06:43:20,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:43:20,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:43:20,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:43:20,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:43:20,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:42:53" (1/3) ... [2024-10-24 06:43:20,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a49def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:43:20, skipping insertion in model container [2024-10-24 06:43:20,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:53" (2/3) ... [2024-10-24 06:43:20,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a49def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:43:20, skipping insertion in model container [2024-10-24 06:43:20,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:43:20" (3/3) ... [2024-10-24 06:43:20,367 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2024-10-24 06:43:20,388 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:43:20,389 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:43:20,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:43:20,464 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;@2e983729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:43:20,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:43:20,470 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-24 06:43:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:43:20,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:43:20,489 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-24 06:43:20,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:43:20,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:43:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1303543091, now seen corresponding path program 1 times [2024-10-24 06:43:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:43:20,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446604536] [2024-10-24 06:43:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:43:20,518 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-24 06:43:20,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:43:20,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:43:20,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:43:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:43:22,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:43:22,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:43:22,387 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-24 06:43:22,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:43:22,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:43:22,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446604536] [2024-10-24 06:43:22,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446604536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:43:22,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:43:22,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:43:22,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439096639] [2024-10-24 06:43:22,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:43:22,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:43:22,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:43:22,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:43:22,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:43:22,431 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-24 06:43:23,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:43:27,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:43:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:43:27,814 INFO L93 Difference]: Finished difference Result 191 states and 345 transitions. [2024-10-24 06:43:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:43:27,866 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-24 06:43:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:43:27,874 INFO L225 Difference]: With dead ends: 191 [2024-10-24 06:43:27,874 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 06:43:27,877 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-24 06:43:27,880 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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, 5.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:43:27,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2024-10-24 06:43:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 06:43:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-24 06:43:27,942 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-24 06:43:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 152 transitions. [2024-10-24 06:43:27,949 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 152 transitions. Word has length 210 [2024-10-24 06:43:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:43:27,954 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 152 transitions. [2024-10-24 06:43:27,954 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-24 06:43:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 152 transitions. [2024-10-24 06:43:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:43:27,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:43:27,960 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-24 06:43:28,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:43:28,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:43:28,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:43:28,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:43:28,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1872049577, now seen corresponding path program 1 times [2024-10-24 06:43:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:43:28,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593631843] [2024-10-24 06:43:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:43:28,164 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-24 06:43:28,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:43:28,168 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:43:28,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:43:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:43:29,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:43:29,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:43:30,323 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-24 06:43:30,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:43:30,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:43:30,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593631843] [2024-10-24 06:43:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593631843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:43:30,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:43:30,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:43:30,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323973797] [2024-10-24 06:43:30,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:43:30,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:43:30,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:43:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:43:30,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:43:30,331 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-24 06:43:34,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:43:38,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:43:42,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:43:44,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:43:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:43:45,505 INFO L93 Difference]: Finished difference Result 284 states and 455 transitions. [2024-10-24 06:43:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:43:45,505 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-24 06:43:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:43:45,510 INFO L225 Difference]: With dead ends: 284 [2024-10-24 06:43:45,510 INFO L226 Difference]: Without dead ends: 190 [2024-10-24 06:43:45,512 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-24 06:43:45,513 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 218 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 68 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s 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, 15.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:43:45,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 420 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 15.1s Time] [2024-10-24 06:43:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-24 06:43:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-10-24 06:43:45,571 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-24 06:43:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 300 transitions. [2024-10-24 06:43:45,575 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 300 transitions. Word has length 210 [2024-10-24 06:43:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:43:45,576 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 300 transitions. [2024-10-24 06:43:45,576 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-24 06:43:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 300 transitions. [2024-10-24 06:43:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 06:43:45,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:43:45,580 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-24 06:43:45,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 06:43:45,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:43:45,782 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:43:45,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:43:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1449347751, now seen corresponding path program 1 times [2024-10-24 06:43:45,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:43:45,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396256267] [2024-10-24 06:43:45,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:43:45,784 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-24 06:43:45,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:43:45,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:43:45,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 06:43:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:43:47,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:43:47,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:43:51,977 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-24 06:43:51,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:43:51,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:43:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396256267] [2024-10-24 06:43:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396256267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:43:51,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:43:51,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:43:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724791263] [2024-10-24 06:43:51,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:43:51,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:43:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:43:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:43:51,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:43:51,986 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-24 06:43:53,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:43:58,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:44:02,324 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-24 06:44:06,527 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 []