./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.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 7bcb547aac761147c22445bf16a253cfb82a704979c79dc9f74fd3cbfa09821b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:41:01,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:41:01,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:41:01,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:41:01,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:41:01,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:41:01,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:41:01,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:41:01,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:41:01,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:41:01,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:41:01,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:41:01,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:41:01,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:41:01,850 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:41:01,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:41:01,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:41:01,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:41:01,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:41:01,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:41:01,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:41:01,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:41:01,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:41:01,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:41:01,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:41:01,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:41:01,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:41:01,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:41:01,854 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:41:01,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:41:01,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:41:01,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:41:01,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:41:01,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:41:01,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:41:01,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:41:01,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:41:01,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:41:01,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:41:01,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:41:01,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:41:01,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:41:01,858 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 -> 7bcb547aac761147c22445bf16a253cfb82a704979c79dc9f74fd3cbfa09821b [2024-11-10 05:41:02,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:41:02,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:41:02,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:41:02,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:41:02,099 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:41:02,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i [2024-11-10 05:41:03,603 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:41:03,754 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:41:03,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i [2024-11-10 05:41:03,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c41bf50b0/5d0c938615d54d20bee287cd7444c21c/FLAG9c0ec39b7 [2024-11-10 05:41:03,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c41bf50b0/5d0c938615d54d20bee287cd7444c21c [2024-11-10 05:41:03,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:41:03,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:41:03,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:41:03,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:41:03,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:41:03,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:41:03" (1/1) ... [2024-11-10 05:41:03,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b39ca17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:03, skipping insertion in model container [2024-11-10 05:41:03,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:41:03" (1/1) ... [2024-11-10 05:41:03,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:41:03,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i[919,932] [2024-11-10 05:41:04,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:41:04,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:41:04,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i[919,932] [2024-11-10 05:41:04,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:41:04,108 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:41:04,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04 WrapperNode [2024-11-10 05:41:04,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:41:04,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:41:04,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:41:04,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:41:04,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,195 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 277 [2024-11-10 05:41:04,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:41:04,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:41:04,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:41:04,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:41:04,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,228 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-11-10 05:41:04,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:41:04,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:41:04,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:41:04,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:41:04,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (1/1) ... [2024-11-10 05:41:04,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:41:04,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:41:04,314 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-11-10 05:41:04,317 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-11-10 05:41:04,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:41:04,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:41:04,361 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:41:04,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:41:04,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:41:04,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:41:04,455 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:41:04,457 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:41:04,813 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc property_#t~bitwise27#1; [2024-11-10 05:41:04,865 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-10 05:41:04,865 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:41:04,900 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:41:04,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:41:04,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:41:04 BoogieIcfgContainer [2024-11-10 05:41:04,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:41:04,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:41:04,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:41:04,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:41:04,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:41:03" (1/3) ... [2024-11-10 05:41:04,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1779a7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:41:04, skipping insertion in model container [2024-11-10 05:41:04,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:04" (2/3) ... [2024-11-10 05:41:04,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1779a7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:41:04, skipping insertion in model container [2024-11-10 05:41:04,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:41:04" (3/3) ... [2024-11-10 05:41:04,911 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i [2024-11-10 05:41:04,929 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:41:04,930 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:41:04,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:41:04,993 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;@146ff094, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:41:04,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:41:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 05:41:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-10 05:41:05,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:05,012 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:05,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:05,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash 124265909, now seen corresponding path program 1 times [2024-11-10 05:41:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:41:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992102982] [2024-11-10 05:41:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:41:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:41:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:41:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:41:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:41:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:41:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:41:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:41:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:41:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:41:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:41:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:41:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:41:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:41:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:41:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:41:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:41:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:41:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:41:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:41:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:41:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:41:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:41:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:41:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:41:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:41:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:41:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:41:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:41:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:41:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:41:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:41:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:41:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:41:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 05:41:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 05:41:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 05:41:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 05:41:05,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:41:05,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992102982] [2024-11-10 05:41:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992102982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:05,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:05,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:41:05,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987076322] [2024-11-10 05:41:05,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:05,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:41:05,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:41:05,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:41:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:41:05,557 INFO L87 Difference]: Start difference. First operand has 123 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 05:41:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:05,649 INFO L93 Difference]: Finished difference Result 236 states and 413 transitions. [2024-11-10 05:41:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:41:05,653 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 234 [2024-11-10 05:41:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:05,663 INFO L225 Difference]: With dead ends: 236 [2024-11-10 05:41:05,664 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 05:41:05,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-11-10 05:41:05,671 INFO L432 NwaCegarLoop]: 178 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, 178 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-11-10 05:41:05,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:41:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 05:41:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-10 05:41:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 05:41:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2024-11-10 05:41:05,718 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 234 [2024-11-10 05:41:05,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:05,718 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2024-11-10 05:41:05,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 05:41:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2024-11-10 05:41:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-10 05:41:05,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:05,722 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:05,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:41:05,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:05,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:05,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1106271157, now seen corresponding path program 1 times [2024-11-10 05:41:05,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:41:05,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960892644] [2024-11-10 05:41:05,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:05,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:41:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:41:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:41:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:41:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:41:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:41:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:05,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:41:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:41:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:41:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:41:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:41:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:41:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:41:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:41:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:41:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:41:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:41:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:41:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:41:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:41:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:41:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:41:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:41:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:41:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:41:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:41:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:41:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:41:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:41:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:41:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:41:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:41:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:41:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:41:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 05:41:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 05:41:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 05:41:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 05:41:06,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:41:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960892644] [2024-11-10 05:41:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960892644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:06,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:06,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:41:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970883262] [2024-11-10 05:41:06,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:06,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:41:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:41:06,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:41:06,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:41:06,116 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:06,185 INFO L93 Difference]: Finished difference Result 342 states and 537 transitions. [2024-11-10 05:41:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:41:06,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 234 [2024-11-10 05:41:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:06,188 INFO L225 Difference]: With dead ends: 342 [2024-11-10 05:41:06,188 INFO L226 Difference]: Without dead ends: 229 [2024-11-10 05:41:06,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 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-11-10 05:41:06,192 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 112 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:41:06,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 341 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:41:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-10 05:41:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-11-10 05:41:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 151 states have (on average 1.403973509933775) internal successors, (212), 151 states have internal predecessors, (212), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 05:41:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 356 transitions. [2024-11-10 05:41:06,222 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 356 transitions. Word has length 234 [2024-11-10 05:41:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 356 transitions. [2024-11-10 05:41:06,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 356 transitions. [2024-11-10 05:41:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-10 05:41:06,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:06,226 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:06,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:41:06,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:06,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash 671464530, now seen corresponding path program 1 times [2024-11-10 05:41:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:41:06,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086675010] [2024-11-10 05:41:06,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:41:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:41:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:41:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:41:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:41:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:41:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:41:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:41:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:41:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:41:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:41:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:41:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:41:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:41:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:41:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:41:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:41:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:41:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:41:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:41:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:41:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:41:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:41:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:41:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:41:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:41:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:41:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:41:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:41:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:41:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:41:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:41:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:41:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:41:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 05:41:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 05:41:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 05:41:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 05:41:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:41:06,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086675010] [2024-11-10 05:41:06,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086675010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:06,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:06,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:41:06,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626318518] [2024-11-10 05:41:06,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:06,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:41:06,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:41:06,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:41:06,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:41:06,551 INFO L87 Difference]: Start difference. First operand 226 states and 356 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:06,730 INFO L93 Difference]: Finished difference Result 449 states and 709 transitions. [2024-11-10 05:41:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:41:06,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 235 [2024-11-10 05:41:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:06,734 INFO L225 Difference]: With dead ends: 449 [2024-11-10 05:41:06,734 INFO L226 Difference]: Without dead ends: 226 [2024-11-10 05:41:06,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:41:06,739 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 166 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:41:06,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 258 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:41:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-10 05:41:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-10 05:41:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 151 states have (on average 1.390728476821192) internal successors, (210), 151 states have internal predecessors, (210), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 05:41:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 354 transitions. [2024-11-10 05:41:06,778 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 354 transitions. Word has length 235 [2024-11-10 05:41:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:06,779 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 354 transitions. [2024-11-10 05:41:06,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 354 transitions. [2024-11-10 05:41:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-10 05:41:06,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:06,784 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:06,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:41:06,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:06,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:06,784 INFO L85 PathProgramCache]: Analyzing trace with hash 95766870, now seen corresponding path program 1 times [2024-11-10 05:41:06,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:41:06,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433873950] [2024-11-10 05:41:06,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:06,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:41:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:41:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:41:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:41:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:41:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:41:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:41:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:41:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:41:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:41:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:41:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:41:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:41:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:41:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:41:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:41:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:41:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:41:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:41:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:41:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:41:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:41:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:41:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:41:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:41:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:41:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:41:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:41:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:41:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:41:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:41:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:41:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:41:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:41:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 05:41:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 05:41:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 05:41:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 05:41:07,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:41:07,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433873950] [2024-11-10 05:41:07,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433873950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:07,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:07,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:41:07,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242048246] [2024-11-10 05:41:07,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:07,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:41:07,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:41:07,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:41:07,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:41:07,172 INFO L87 Difference]: Start difference. First operand 226 states and 354 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:07,252 INFO L93 Difference]: Finished difference Result 545 states and 857 transitions. [2024-11-10 05:41:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:41:07,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 236 [2024-11-10 05:41:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:07,255 INFO L225 Difference]: With dead ends: 545 [2024-11-10 05:41:07,255 INFO L226 Difference]: Without dead ends: 322 [2024-11-10 05:41:07,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 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-11-10 05:41:07,259 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 90 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:41:07,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 500 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:41:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-10 05:41:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 298. [2024-11-10 05:41:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 186 states have (on average 1.3494623655913978) internal successors, (251), 186 states have internal predecessors, (251), 108 states have call successors, (108), 3 states have call predecessors, (108), 3 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 05:41:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 467 transitions. [2024-11-10 05:41:07,298 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 467 transitions. Word has length 236 [2024-11-10 05:41:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:07,299 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 467 transitions. [2024-11-10 05:41:07,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 467 transitions. [2024-11-10 05:41:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-10 05:41:07,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:07,301 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:07,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:41:07,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:07,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1261185104, now seen corresponding path program 1 times [2024-11-10 05:41:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:41:07,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916490462] [2024-11-10 05:41:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:07,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:41:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:41:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:41:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:41:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:41:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:41:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:41:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:41:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:41:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:41:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:41:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:41:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:41:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:41:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:41:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:41:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:41:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:41:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:41:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:41:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:41:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:41:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:41:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:41:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:41:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:41:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:41:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:41:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:41:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:41:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:41:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:41:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:41:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:41:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 05:41:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 05:41:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 05:41:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 05:41:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:41:07,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916490462] [2024-11-10 05:41:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916490462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:07,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:07,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:41:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567841003] [2024-11-10 05:41:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:07,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:41:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:41:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:41:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:41:07,848 INFO L87 Difference]: Start difference. First operand 298 states and 467 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:08,063 INFO L93 Difference]: Finished difference Result 545 states and 855 transitions. [2024-11-10 05:41:08,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:41:08,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 237 [2024-11-10 05:41:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:08,069 INFO L225 Difference]: With dead ends: 545 [2024-11-10 05:41:08,069 INFO L226 Difference]: Without dead ends: 322 [2024-11-10 05:41:08,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 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-11-10 05:41:08,071 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 88 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:41:08,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 416 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:41:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-10 05:41:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 299. [2024-11-10 05:41:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 187 states have (on average 1.3475935828877006) internal successors, (252), 187 states have internal predecessors, (252), 108 states have call successors, (108), 3 states have call predecessors, (108), 3 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 05:41:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 468 transitions. [2024-11-10 05:41:08,137 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 468 transitions. Word has length 237 [2024-11-10 05:41:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:08,137 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 468 transitions. [2024-11-10 05:41:08,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 468 transitions. [2024-11-10 05:41:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-10 05:41:08,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:08,143 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:08,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:41:08,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:08,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1960504622, now seen corresponding path program 1 times [2024-11-10 05:41:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:41:08,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308862202] [2024-11-10 05:41:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:08,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:41:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:41:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:41:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:41:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:41:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:41:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:41:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:41:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:41:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:41:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:41:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:41:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:41:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:41:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:41:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:41:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:41:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:41:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:41:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:41:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:41:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:41:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:41:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:41:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:41:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:41:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:41:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:41:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:41:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:41:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:41:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:41:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:41:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:41:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 05:41:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 05:41:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 05:41:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 05:41:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:41:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308862202] [2024-11-10 05:41:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308862202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:08,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 05:41:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626910336] [2024-11-10 05:41:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:08,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:41:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:41:08,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:41:08,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:41:08,799 INFO L87 Difference]: Start difference. First operand 299 states and 468 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:09,648 INFO L93 Difference]: Finished difference Result 826 states and 1275 transitions. [2024-11-10 05:41:09,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 05:41:09,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 238 [2024-11-10 05:41:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:09,651 INFO L225 Difference]: With dead ends: 826 [2024-11-10 05:41:09,652 INFO L226 Difference]: Without dead ends: 603 [2024-11-10 05:41:09,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-10 05:41:09,653 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 473 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:41:09,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1186 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 05:41:09,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-10 05:41:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 350. [2024-11-10 05:41:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 238 states have (on average 1.365546218487395) internal successors, (325), 238 states have internal predecessors, (325), 108 states have call successors, (108), 3 states have call predecessors, (108), 3 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 05:41:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 541 transitions. [2024-11-10 05:41:09,686 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 541 transitions. Word has length 238 [2024-11-10 05:41:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:09,686 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 541 transitions. [2024-11-10 05:41:09,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 541 transitions. [2024-11-10 05:41:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-10 05:41:09,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:09,688 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:09,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 05:41:09,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:09,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:09,689 INFO L85 PathProgramCache]: Analyzing trace with hash -343892129, now seen corresponding path program 1 times [2024-11-10 05:41:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:41:09,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22717051] [2024-11-10 05:41:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:09,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:41:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:41:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:41:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:41:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:41:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:41:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:41:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:41:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:41:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:41:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:41:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:41:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:41:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:41:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:41:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:41:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:41:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:41:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:41:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:41:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:41:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:41:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:41:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:41:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:41:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:41:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:41:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:41:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:41:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:41:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:41:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:41:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:41:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:41:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 05:41:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 05:41:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 05:41:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 05:41:10,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:41:10,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22717051] [2024-11-10 05:41:10,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22717051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:10,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:10,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 05:41:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310580044] [2024-11-10 05:41:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:10,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:41:10,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:41:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:41:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:41:10,330 INFO L87 Difference]: Start difference. First operand 350 states and 541 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:10,911 INFO L93 Difference]: Finished difference Result 735 states and 1119 transitions. [2024-11-10 05:41:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 05:41:10,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 239 [2024-11-10 05:41:10,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:10,914 INFO L225 Difference]: With dead ends: 735 [2024-11-10 05:41:10,914 INFO L226 Difference]: Without dead ends: 512 [2024-11-10 05:41:10,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-10 05:41:10,916 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 432 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:41:10,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 967 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:41:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-10 05:41:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 355. [2024-11-10 05:41:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 242 states have (on average 1.3636363636363635) internal successors, (330), 242 states have internal predecessors, (330), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 05:41:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 546 transitions. [2024-11-10 05:41:10,957 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 546 transitions. Word has length 239 [2024-11-10 05:41:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:10,958 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 546 transitions. [2024-11-10 05:41:10,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 546 transitions. [2024-11-10 05:41:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-10 05:41:10,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:10,960 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:10,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:41:10,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:10,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1913018878, now seen corresponding path program 1 times [2024-11-10 05:41:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:41:10,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372603113] [2024-11-10 05:41:10,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:10,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:41:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:41:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:41:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:41:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:41:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:41:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:41:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:41:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:41:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:41:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:41:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:41:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:41:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:41:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:41:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:41:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:41:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:41:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:41:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:41:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:41:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:41:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:41:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:41:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:41:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:41:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:41:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:41:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:41:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:41:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:41:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:41:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:41:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:41:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 05:41:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 05:41:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 05:41:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 05:41:11,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:41:11,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372603113] [2024-11-10 05:41:11,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372603113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:11,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:11,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 05:41:11,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753559060] [2024-11-10 05:41:11,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:11,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:41:11,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:41:11,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:41:11,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:41:11,540 INFO L87 Difference]: Start difference. First operand 355 states and 546 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:11,802 INFO L93 Difference]: Finished difference Result 711 states and 1098 transitions. [2024-11-10 05:41:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:41:11,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 239 [2024-11-10 05:41:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:11,805 INFO L225 Difference]: With dead ends: 711 [2024-11-10 05:41:11,805 INFO L226 Difference]: Without dead ends: 488 [2024-11-10 05:41:11,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:41:11,808 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 128 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:41:11,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 866 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:41:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-10 05:41:11,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 483. [2024-11-10 05:41:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 352 states have (on average 1.4005681818181819) internal successors, (493), 354 states have internal predecessors, (493), 124 states have call successors, (124), 6 states have call predecessors, (124), 6 states have return successors, (124), 122 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-10 05:41:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 741 transitions. [2024-11-10 05:41:11,855 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 741 transitions. Word has length 239 [2024-11-10 05:41:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:11,855 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 741 transitions. [2024-11-10 05:41:11,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 741 transitions. [2024-11-10 05:41:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-10 05:41:11,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:11,858 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:11,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 05:41:11,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:11,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1537476547, now seen corresponding path program 1 times [2024-11-10 05:41:11,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:41:11,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548415863] [2024-11-10 05:41:11,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:11,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:41:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:41:11,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513453421] [2024-11-10 05:41:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:11,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:41:11,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:41:11,936 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-11-10 05:41:11,937 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-11-10 05:41:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:41:12,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:41:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:41:12,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:41:12,309 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:41:12,310 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:41:12,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 05:41:12,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:41:12,515 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:41:12,626 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:41:12,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:41:12 BoogieIcfgContainer [2024-11-10 05:41:12,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:41:12,629 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:41:12,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:41:12,629 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:41:12,629 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:41:04" (3/4) ... [2024-11-10 05:41:12,631 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:41:12,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:41:12,633 INFO L158 Benchmark]: Toolchain (without parser) took 8846.23ms. Allocated memory was 148.9MB in the beginning and 392.2MB in the end (delta: 243.3MB). Free memory was 77.5MB in the beginning and 160.2MB in the end (delta: -82.7MB). Peak memory consumption was 161.7MB. Max. memory is 16.1GB. [2024-11-10 05:41:12,633 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 148.9MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:41:12,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.28ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 59.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 05:41:12,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.59ms. Allocated memory was 148.9MB in the beginning and 239.1MB in the end (delta: 90.2MB). Free memory was 59.7MB in the beginning and 209.0MB in the end (delta: -149.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-10 05:41:12,633 INFO L158 Benchmark]: Boogie Preprocessor took 68.93ms. Allocated memory is still 239.1MB. Free memory was 209.0MB in the beginning and 203.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:41:12,634 INFO L158 Benchmark]: IcfgBuilder took 634.54ms. Allocated memory is still 239.1MB. Free memory was 203.8MB in the beginning and 169.2MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-10 05:41:12,634 INFO L158 Benchmark]: TraceAbstraction took 7723.88ms. Allocated memory was 239.1MB in the beginning and 392.2MB in the end (delta: 153.1MB). Free memory was 168.1MB in the beginning and 161.2MB in the end (delta: 6.9MB). Peak memory consumption was 161.0MB. Max. memory is 16.1GB. [2024-11-10 05:41:12,634 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 392.2MB. Free memory was 161.2MB in the beginning and 160.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:41:12,635 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.22ms. Allocated memory is still 148.9MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.28ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 59.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.59ms. Allocated memory was 148.9MB in the beginning and 239.1MB in the end (delta: 90.2MB). Free memory was 59.7MB in the beginning and 209.0MB in the end (delta: -149.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.93ms. Allocated memory is still 239.1MB. Free memory was 209.0MB in the beginning and 203.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 634.54ms. Allocated memory is still 239.1MB. Free memory was 203.8MB in the beginning and 169.2MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7723.88ms. Allocated memory was 239.1MB in the beginning and 392.2MB in the end (delta: 153.1MB). Free memory was 168.1MB in the beginning and 161.2MB in the end (delta: 6.9MB). Peak memory consumption was 161.0MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 392.2MB. Free memory was 161.2MB in the beginning and 160.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 206, overapproximation of bitwiseOr at line 86, overapproximation of someBinaryArithmeticDOUBLEoperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 206. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned char var_1_20 = 0; [L39] double var_1_21 = 4.65; [L40] unsigned char var_1_22 = 0; [L41] double var_1_23 = 9999999999.1; [L42] double var_1_24 = 5.5; [L43] unsigned short int var_1_25 = 16; [L44] unsigned short int var_1_26 = 100; [L45] signed long int var_1_27 = 32; [L46] signed long int var_1_28 = 16; [L47] signed long int var_1_29 = 5; [L48] signed long int var_1_30 = 32; [L49] signed char var_1_31 = 32; [L50] signed char var_1_32 = 32; [L51] signed short int var_1_33 = 100; [L52] unsigned char var_1_34 = 1; [L53] double var_1_35 = 3.8; [L54] unsigned char var_1_36 = 0; [L55] signed short int var_1_37 = -256; [L56] unsigned short int var_1_38 = 4; [L57] double last_1_var_1_9 = 4.6; [L58] unsigned char last_1_var_1_12 = 100; [L59] unsigned char last_1_var_1_14 = 0; [L60] signed long int last_1_var_1_16 = 0; VAL [isInitial=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L200] last_1_var_1_9 = var_1_9 [L201] last_1_var_1_12 = var_1_12 [L202] last_1_var_1_14 = var_1_14 [L203] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L213] RET updateLastVariables() [L214] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L145] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L145] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L146] var_1_7 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L147] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L148] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L148] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L149] var_1_8 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L150] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L151] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L151] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L152] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L152] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L153] var_1_10 = __VERIFIER_nondet_double() [L154] 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_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L154] 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_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L157] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L157] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L158] var_1_18 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L159] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L160] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L160] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L161] var_1_19 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L162] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L163] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L163] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L164] var_1_20 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L165] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L166] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L166] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L167] var_1_22 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L168] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L169] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L169] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L170] var_1_23 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L171] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L172] var_1_24 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L173] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L174] var_1_26 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L175] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L176] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L176] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=16, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L177] var_1_28 = __VERIFIER_nondet_long() [L178] CALL assume_abort_if_not(var_1_28 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L178] RET assume_abort_if_not(var_1_28 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L179] CALL assume_abort_if_not(var_1_28 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L179] RET assume_abort_if_not(var_1_28 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=5, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L180] var_1_29 = __VERIFIER_nondet_long() [L181] CALL assume_abort_if_not(var_1_29 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L181] RET assume_abort_if_not(var_1_29 >= -1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L182] CALL assume_abort_if_not(var_1_29 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L182] RET assume_abort_if_not(var_1_29 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L183] var_1_30 = __VERIFIER_nondet_long() [L184] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L184] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L185] CALL assume_abort_if_not(var_1_30 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L185] RET assume_abort_if_not(var_1_30 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L186] var_1_31 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L187] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L188] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L188] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L189] var_1_32 = __VERIFIER_nondet_char() [L190] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L190] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L191] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L191] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L192] var_1_35 = __VERIFIER_nondet_double() [L193] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L193] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L194] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L194] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L195] var_1_36 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L196] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L197] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L197] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L214] RET updateVariables() [L215] CALL step() [L64] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L65] COND FALSE !(\read(last_1_var_1_14)) [L76] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L78] var_1_16 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L79] COND FALSE !(var_1_31 >= var_1_32) [L84] var_1_34 = ((var_1_24 >= (var_1_21 / var_1_35)) || var_1_36) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L86] EXPR var_1_29 | var_1_25 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L86] EXPR var_1_27 ^ (var_1_29 | var_1_25) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L86] EXPR var_1_31 ^ var_1_30 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L86] COND FALSE !((var_1_27 ^ (var_1_29 | var_1_25)) < (var_1_31 ^ var_1_30)) [L89] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L90] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L91] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L92] COND FALSE !(stepLocal_5 >= var_1_16) [L95] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L98] var_1_38 = var_1_26 [L99] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L100] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L100] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L101] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L105] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L106] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L107] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L110] COND TRUE stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1) [L111] var_1_6 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L114] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L115] COND FALSE !(((((var_1_21) > (var_1_24)) ? (var_1_21) : (var_1_24))) > var_1_23) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L128] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L129] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L130] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L132] COND TRUE ! var_1_22 [L133] var_1_21 = (var_1_23 - ((((7.7) > (var_1_24)) ? (7.7) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L135] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L136] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L137] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L139] var_1_17 = (var_1_18 || (var_1_19 && var_1_20)) [L140] var_1_33 = var_1_31 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L215] RET step() [L216] CALL, EXPR property() [L206] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L206-L207] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 9, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1489 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1489 mSDsluCounter, 4712 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3201 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1755 IncrementalHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 1511 mSDtfsCounter, 1755 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 676 GetRequests, 634 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=8, InterpolantAutomatonStates: 42, 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, 8 MinimizatonAttempts, 465 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2370 NumberOfCodeBlocks, 2370 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1884 ConstructedInterpolants, 0 QuantifiedInterpolants, 6597 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 20160/20160 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-11-10 05:41:12,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.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 7bcb547aac761147c22445bf16a253cfb82a704979c79dc9f74fd3cbfa09821b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:41:14,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:41:14,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:41:14,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:41:14,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:41:14,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:41:14,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:41:14,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:41:14,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:41:14,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:41:14,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:41:14,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:41:14,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:41:14,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:41:14,874 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:41:14,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:41:14,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:41:14,877 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:41:14,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:41:14,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:41:14,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:41:14,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:41:14,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:41:14,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:41:14,878 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:41:14,878 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:41:14,878 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:41:14,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:41:14,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:41:14,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:41:14,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:41:14,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:41:14,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:41:14,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:41:14,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:41:14,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:41:14,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:41:14,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:41:14,880 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:41:14,880 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:41:14,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:41:14,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:41:14,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:41:14,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:41:14,883 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 -> 7bcb547aac761147c22445bf16a253cfb82a704979c79dc9f74fd3cbfa09821b [2024-11-10 05:41:15,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:41:15,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:41:15,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:41:15,202 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:41:15,203 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:41:15,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i [2024-11-10 05:41:16,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:41:16,847 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:41:16,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i [2024-11-10 05:41:16,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/548263638/5c1c0b3362654da39500e1d663438455/FLAGaa62b6f32 [2024-11-10 05:41:16,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/548263638/5c1c0b3362654da39500e1d663438455 [2024-11-10 05:41:16,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:41:16,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:41:16,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:41:16,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:41:16,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:41:16,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:41:16" (1/1) ... [2024-11-10 05:41:16,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff57c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:16, skipping insertion in model container [2024-11-10 05:41:16,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:41:16" (1/1) ... [2024-11-10 05:41:16,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:41:17,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i[919,932] [2024-11-10 05:41:17,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:41:17,203 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:41:17,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i[919,932] [2024-11-10 05:41:17,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:41:17,271 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:41:17,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17 WrapperNode [2024-11-10 05:41:17,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:41:17,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:41:17,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:41:17,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:41:17,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,322 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-11-10 05:41:17,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:41:17,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:41:17,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:41:17,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:41:17,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,357 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-11-10 05:41:17,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,386 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:41:17,399 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:41:17,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:41:17,403 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:41:17,404 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (1/1) ... [2024-11-10 05:41:17,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:41:17,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:41:17,432 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-11-10 05:41:17,440 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-11-10 05:41:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:41:17,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:41:17,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:41:17,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:41:17,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:41:17,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:41:17,580 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:41:17,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:41:19,535 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 05:41:19,535 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:41:19,546 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:41:19,546 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:41:19,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:41:19 BoogieIcfgContainer [2024-11-10 05:41:19,546 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:41:19,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:41:19,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:41:19,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:41:19,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:41:16" (1/3) ... [2024-11-10 05:41:19,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c70b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:41:19, skipping insertion in model container [2024-11-10 05:41:19,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:41:17" (2/3) ... [2024-11-10 05:41:19,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c70b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:41:19, skipping insertion in model container [2024-11-10 05:41:19,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:41:19" (3/3) ... [2024-11-10 05:41:19,552 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-68.i [2024-11-10 05:41:19,571 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:41:19,571 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:41:19,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:41:19,629 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;@6fea2e86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:41:19,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:41:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 64 states have (on average 1.359375) internal successors, (87), 65 states have internal predecessors, (87), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 05:41:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-10 05:41:19,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:19,651 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:19,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:19,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash 533875301, now seen corresponding path program 1 times [2024-11-10 05:41:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:41:19,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085452069] [2024-11-10 05:41:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:19,665 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-11-10 05:41:19,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:41:19,685 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-11-10 05:41:19,686 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-11-10 05:41:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:20,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:41:20,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:41:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2024-11-10 05:41:20,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:41:20,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:41:20,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085452069] [2024-11-10 05:41:20,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085452069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:20,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:20,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:41:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250523122] [2024-11-10 05:41:20,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:20,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:41:20,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:41:20,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:41:20,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:41:20,589 INFO L87 Difference]: Start difference. First operand has 103 states, 64 states have (on average 1.359375) internal successors, (87), 65 states have internal predecessors, (87), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 05:41:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:20,614 INFO L93 Difference]: Finished difference Result 198 states and 347 transitions. [2024-11-10 05:41:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:41:20,616 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 228 [2024-11-10 05:41:20,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:20,622 INFO L225 Difference]: With dead ends: 198 [2024-11-10 05:41:20,622 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 05:41:20,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 227 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-11-10 05:41:20,628 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:41:20,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:41:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 05:41:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 05:41:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 05:41:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2024-11-10 05:41:20,671 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 228 [2024-11-10 05:41:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:20,672 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2024-11-10 05:41:20,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 05:41:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2024-11-10 05:41:20,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-10 05:41:20,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:20,676 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:20,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 05:41:20,877 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-11-10 05:41:20,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:20,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash 440074341, now seen corresponding path program 1 times [2024-11-10 05:41:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:41:20,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588310266] [2024-11-10 05:41:20,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:20,880 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-11-10 05:41:20,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:41:20,885 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-11-10 05:41:20,890 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-11-10 05:41:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:21,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:41:21,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:41:26,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 05:41:26,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:41:26,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:41:26,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588310266] [2024-11-10 05:41:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588310266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:26,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:26,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 05:41:26,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839012901] [2024-11-10 05:41:26,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:26,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 05:41:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:41:26,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 05:41:26,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:41:26,195 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:35,852 INFO L93 Difference]: Finished difference Result 431 states and 659 transitions. [2024-11-10 05:41:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 05:41:35,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2024-11-10 05:41:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:35,869 INFO L225 Difference]: With dead ends: 431 [2024-11-10 05:41:35,869 INFO L226 Difference]: Without dead ends: 336 [2024-11-10 05:41:35,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-10 05:41:35,875 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 382 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:41:35,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 846 Invalid, 986 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [107 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-10 05:41:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-10 05:41:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 293. [2024-11-10 05:41:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 171 states have (on average 1.280701754385965) internal successors, (219), 173 states have internal predecessors, (219), 116 states have call successors, (116), 5 states have call predecessors, (116), 5 states have return successors, (116), 114 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-10 05:41:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 451 transitions. [2024-11-10 05:41:35,921 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 451 transitions. Word has length 228 [2024-11-10 05:41:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:35,922 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 451 transitions. [2024-11-10 05:41:35,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 451 transitions. [2024-11-10 05:41:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-10 05:41:35,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:35,925 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:35,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 05:41:36,125 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-11-10 05:41:36,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash -70459836, now seen corresponding path program 1 times [2024-11-10 05:41:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:41:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095591970] [2024-11-10 05:41:36,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:36,130 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-11-10 05:41:36,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:41:36,133 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-11-10 05:41:36,134 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-11-10 05:41:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:36,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 05:41:36,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:41:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 05:41:37,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:41:37,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:41:37,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095591970] [2024-11-10 05:41:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095591970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:41:37,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:41:37,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:41:37,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172395805] [2024-11-10 05:41:37,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:41:37,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:41:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:41:37,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:41:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:41:37,232 INFO L87 Difference]: Start difference. First operand 293 states and 451 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:41:37,814 INFO L93 Difference]: Finished difference Result 501 states and 769 transitions. [2024-11-10 05:41:37,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:41:37,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2024-11-10 05:41:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:41:37,846 INFO L225 Difference]: With dead ends: 501 [2024-11-10 05:41:37,846 INFO L226 Difference]: Without dead ends: 293 [2024-11-10 05:41:37,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:41:37,855 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 142 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:41:37,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 279 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:41:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-10 05:41:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-10 05:41:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 171 states have (on average 1.263157894736842) internal successors, (216), 173 states have internal predecessors, (216), 116 states have call successors, (116), 5 states have call predecessors, (116), 5 states have return successors, (116), 114 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-10 05:41:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 448 transitions. [2024-11-10 05:41:37,910 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 448 transitions. Word has length 228 [2024-11-10 05:41:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:41:37,912 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 448 transitions. [2024-11-10 05:41:37,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 05:41:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 448 transitions. [2024-11-10 05:41:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-10 05:41:37,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:41:37,916 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:41:37,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 05:41:38,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:41:38,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:41:38,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:41:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash -179487714, now seen corresponding path program 1 times [2024-11-10 05:41:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:41:38,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494717877] [2024-11-10 05:41:38,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:38,124 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-11-10 05:41:38,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:41:38,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:41:38,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 05:41:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:38,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 05:41:38,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:41:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 681 proven. 186 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 05:41:51,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:41:55,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:41:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494717877] [2024-11-10 05:41:55,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494717877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:41:55,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1654999862] [2024-11-10 05:41:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:41:55,762 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:41:55,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:41:55,765 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:41:55,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-10 05:41:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:41:58,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 05:41:58,487 INFO L278 TraceCheckSpWp]: Computing forward predicates...